EP1879120B1 - Systems and methods for querying metamodel data - Google Patents
Systems and methods for querying metamodel data Download PDFInfo
- Publication number
- EP1879120B1 EP1879120B1 EP07013708.8A EP07013708A EP1879120B1 EP 1879120 B1 EP1879120 B1 EP 1879120B1 EP 07013708 A EP07013708 A EP 07013708A EP 1879120 B1 EP1879120 B1 EP 1879120B1
- Authority
- EP
- European Patent Office
- Prior art keywords
- query
- data
- metamodel
- indicator
- parent
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims description 45
- 229910001369 Brass Inorganic materials 0.000 description 17
- 239000010951 brass Substances 0.000 description 17
- 238000013459 approach Methods 0.000 description 10
- 238000004590 computer program Methods 0.000 description 5
- 230000008569 process Effects 0.000 description 5
- 238000004891 communication Methods 0.000 description 4
- 238000004519 manufacturing process Methods 0.000 description 4
- 230000007246 mechanism Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 238000013499 data model Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 230000009182 swimming Effects 0.000 description 2
- 238000012360 testing method Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000002457 bidirectional effect Effects 0.000 description 1
- 239000003795 chemical substances by application Substances 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000000446 fuel Substances 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 239000004033 plastic Substances 0.000 description 1
- 230000000644 propagated effect Effects 0.000 description 1
- 241000894007 species Species 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
- G06F16/9032—Query formulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/80—Information retrieval; Database structures therefor; File system structures therefor of semi-structured data, e.g. markup language structured data such as SGML, XML or HTML
- G06F16/83—Querying
- G06F16/832—Query formulation
Description
- The present invention generally relates to data processing. More particularly, the present invention relates to systems and methods for querying data, such as data structured in a hierarchical format.
- A metamodel is a data model that selects and structures the data for a specific purpose. By selecting specific data and viewing it in a specific way, the metamodel can decrease the time required by, and eliminate unnecessary detail from, an activity. For example, consider an aerial photograph that shows every road, street, driveway, and backyard swimming pool in a given geographical area. This view, or metamodel, might be quite valuable in observing changes to a neighborhood over time. In contrast, a street map of the same area might be an excellent metamodel for a tourist trying to find a particular address, and an aeronautical chart may help a private pilot pinpoint her destination airport. The underlying information or data (in this case, every physical thing in the geographical area) is exactly the same, but each metamodel (the aerial photograph, the street map, and the aeronautical chart) provides a different view of the data that is selected (e.g., no backyard swimming pools on the aeronautical chart) and structured (e.g., street names printed and major roads shown in color on the street map) to facilitate a specific purpose. Imagine how cumbersome it might be for tourists to find their way around with an aerial photograph. Thus, the metamodel eliminates unnecessary data from the view and provides more rapid access and processing of the information.
- The metamodel may serve as a schema (i.e., structured framework or plan) for storing and organizing data-enabling the schema to define the organization of the data. For example, the metamodel may organize the data in a tree-like, hierarchical structure. In this type of structure, a piece of data is referred to as a "node," and nodes may be defined to have relationships (also referred to as associations, links, or paths) that link nodes to each other. For example, nodes may be referred to as parent nodes and child nodes. The parent node may be related to one or more child nodes. Moreover, the parent node may be higher in the hierarchy than a child node. For example, in a customer database, customer information may be organized as a parent node and a sales order associated with the customer may be organized as a child node. The child node, in this example a sales order, includes sales order information, such as products ordered, product descriptions, delivery dates, ship dates, and the like. In a metamodel, the relationship between a two nodes is given an explicit name (e.g., "ExecutedOrders") which can then be used to refer to all node sets related in the same way. This is referred to as a "named relationship". As used herein, the phrase "metamodel data" refers to data organized according to a schema or plan.
- Metamodel data may be stored in a database to allow a user to perform a query of the metamodel data. A query is the primary mechanism for retrieving information from a database and consists of questions presented to the database in a predefined format. For example, some databases use the Structured Query Language (SQL) to retrieve metamodel data or portions of that data. XPath is a query language which is used to perform queries on XML (eXtensible Markup Language) documents. XPath may also be adapted for use with metamodel data. XML is an extensible markup language which is used to describe data.
- Past approaches for querying data, which can be used with metamodel data, may be limited in the types of queries that can be performed. In particular, these approaches may only allow the computer to access data according to the named relationships (or associations) that are defined in the metamodel. For example, in a metamodel that identifies a human and a pet living in each house on a street with the named relationship name "HumansPets", the computer may identify the pets living with the human "Bob" because the named relationship of "HumansPets" is defined in the meta model and specified in the query. However, using past query tools, the computer would not be able to identify the pets living next door to the human "Bob" because the metamodel did not define the neighbors, only "HumansPets" and the query can only search on specified named relationships. If a relationship between two pieces of data (or nodes) is not defined in the metamodel, there may be no way of accessing the data in a query. In addition, querying data may only be executed in one direction, such as from a parent node to a child node using the defined and named relationship between the nodes. Querying the data from a child node to a parent node may not be possible using past approaches to querying a metamodel. Also, past approaches may require the computer system to test every piece of data to determine if it answers the query. Moreover, there may be no mechanism to stop the query process once a positive result is reached (i.e., a result that answers the query). In addition, it may be necessary at times for an application to call itself to complete a query. This type of recursive query may not be possible with past approaches. In view of the foregoing, there is a need to improve past approaches of accessing data associated with a metamodel.
- It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention, as described. Further features and/or variations may be provided in addition to those set forth herein. For example, the present invention may be directed to various combinations and subcombinations of the disclosed features and/or combinations and subcombinations of several further features disclosed below in the detailed description.
- Document JIE WU ET AL: "ATRAM-an analysis tool of requirement and architecture management" 2003 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS. SMC'03. 5 - 8, 2003, IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, NEW YORK, NY: IEEE, US, vol. VOL. 5 OF 5, 5 October 2003, pages 2654-2660, XP010668019 ISBN: 0-7803-7952-7 discloses a method for querying metamodel data, the metamodel data forming sets of parent and child nodes.
- Document
US 2006/0041661 A1 discloses a method of providing internet access to a data object repository comprising managing data objects hosted by said repository using a generalised repository directed graph data model having object nodes and resources. Said resources comprise at least one of a literal; actual resource data; and/or a URI directing a request for resources to an address. The object nodes comprise higher level abstractions of data objects, wherein all object nodes and resources are named, as well as all arcs between object nodes and other object nodes or resources, said arcs modelling properties of said nodes. Each said directed graph has a graph interface which represents data as a directed graph of nodes and resources. The graph interface is capable of enabling access to data represented by said directed graph by traversal of said directed graph using http:GET. - Document REVELIOTIS P ET AL: "Your Enterprise on Xquery and XML Schema: XML-based Data and Metadata Integration" DATA ENGINEERING WORKSHOPS. 2006, PROCEEDINGS. 22ND INTERNATIONAL CONFERENCE ON ATLANTA, USA, PISCATAWAY, NJ, USA, IEEE, 3 April 2006, pages 80-89, XP010911975 discloses an approach, based on XQuery and XML Schema, to modelling and accessing the variety of data source types found in an enterprise. These include relational, Web service, functional-based (a.k.a. service-based), and file-based data sources. The approach is based on introspection of data source meta-information and generation of metadata artifacts that conform to a common model and that provide a uniform framework in which the data sources become available to an XQuery-based query processor.
- Document
US 2005/0289184 A1 discloses a method, system and article of manufacture for managing relationships in a data abstraction model abstractly describing data in a database. One embodiment provides a method of linking logical branches of data in a database based on the relationships. The method includes accessing a data abstraction model abstractly describing the data in the database. The data abstraction model defines a logical tree structure having a plurality of logical branches. Relationships between logical fields of different logical branches are identified and logical links abstractly describing the identified relationships are created. - Document HEARNDEN D ET AL: "MQL: a powerful extension to OCL for MOF queries" ENTERPRISE DISTRIBUTED OBJECT COMPUTING CONFERENCE, 2003. PROCEEDINGS. SEVENTH IEEE INTERNATIONAL 16-19 SEPT. 2003, PISCATAWAY, NJ, USA, IEEE, 16 September 2003, pages 264-276, XP010659498 discloses a standardised framework for object-oriented models. Information contained in objects can be accessed directly, and a language for implementing a mechanism for representing and evaluating structured queries on these instances is disclosed. An interpreter evaluates queries written in this language.
- Thus, according to an aspect, it is a problem to provide a method for querying data, which can be used with metamodel data, and which is not limited in the types of queries that can be performed.
- This problem is solved by the method being the features disclosed in
claim 1. Preferred embodiments are defined in the dependent subclaims. - Systems, methods, and articles of manufacture consistent with the invention perform queries on metamodel data.
- According to the invention, there is provided a method for querying metamodel data to form sets of parent and child nodes. For one type of query, the method includes receiving, at a computer, a query indicator, the query indicator defining a type of query for a value in the metamodel data; performing, based on the query indicator, the query for the value by searching a first set of parent and child nodes and recursively querying the metamodel data to identify the value in another set of parent and child nodes; and providing, as a result, the value and at least one of the nodes from the sets of parent and child nodes.
- For another type of query, the method includes receiving, at a computer, a query indicator, the query indicator defining a type of query for a value in the metamodel data; performing, based on the query indicator, the query for the value by searching a set - of parent and child nodes and reverse querying the metamodel data to identify the value of the parent node based on the child node; and providing, as a result, the value and at least one of the nodes from the sets of parent and child nodes.
- For another type of query, the method includes receiving, at a computer, a query indicator, the query indicator defining a type of query for a value in the metamodel data; performing, based on the query indicator, the query for the value by searching the metamodel data using named relationships to identify the value in a set of parent and child nodes; and providing, as a result, the value and at least one of the nodes from the sets of parent and child nodes.
- It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention, as described. Further features and/or variations may be directed to various combinations and subcombinations of the disclosed features and/or combinations and subcombinations of several further features disclosed below in the detailed description.
- The accompanying drawings, which are incorporated in and constitute a part of this specification, show certain aspects of the present invention and help to explain some of the principles associated with the invention. In the drawings:
-
FIG. 1 is a block diagram of an exemplary system consistent with certain aspects related to the disclosed invention; -
FIG. 2 is another block diagram of an exemplary method consistent with certain aspects related to the present invention; -
FIG. 3 is another exemplary depiction of metamodel data consistent with certain aspects related to the present invention; -
FIG. 4 is another exemplary depiction of metamodel data consistent with certain aspects related to the present invention; and -
FIG. 5 is another exemplary depiction of metamodel data consistent with certain aspects related to the present invention. - Reference will now be made in detail to the invention, examples of which are illustrated in the accompanying drawings. The implementations set forth in the following description do not represent all implementations consistent with the claimed invention. Instead, they are merely some examples consistent with certain aspects related to the invention. Wherever possible, the same reference numbers will be used throughout the drawings to refer to the same or like parts.
-
FIG. 1 depicts a block diagram of anexemplary system environment 100 for querying metamodel data. The metamodel data may be implemented as data structured to form sets of parent and child nodes. -
System 100 includes aclient 102,metamodel data 106, aserver 104, andnetwork connections Client 102 may further include a user interface 110, whileserver 104 may further include anapplication 108 to access and then querymetamodel data 106. -
Client 102 may be implemented as a processor, such as a computer, to interface withserver 104 throughnetwork connection 112a.Client 102 may include a monitor, a keyboard device, a network interface, memory, storage, and any other hardware and software suitable for use with a processor, such as a computer.Client 102 may also include user interface 110 to allow a user to interact with an application, such asapplication 108 atserver 104. The user interface 110 may be implemented as a graphical user interface, such as a browser, JAVA applet, and the like, to allow the user to interact withapplication 108 by issuing commands toapplication 108. The user may consist of a human operator or a computer-implemented process. In some implementations, SAP Web Dynpro (commercially available from SAP AG, Walldorf, Germany) is used as a model-based development environment for generating a user interface, although other development environments may also be used to develop the user interface. - The
metamodel data 106 may include data stored in a database or other suitable storage structure. The metamodel may serve as a schema for storing data inmetamodel data 106 and as a language that supports actions, such as queries, ofmetamodel data 106. Data may have a value, such as a numerical quantity, that defines the content of the data. Additional examples ofmetamodel data 106 will be provided below with respect to-Figs. 3-5 . -
Server 104 may be implemented as a processor, such as a computer, to interface withclient 102 throughnetwork connection 112a.Server 104 may also interface to metamodeldata 106 throughnetwork connection 112b. Moreover,server 104 may includeapplication 108 for executing queries ofmetamodel data 106.Application 108 may be implemented as XSLT (Extensible Stylesheet Language Transformation), XPointer, or any other type of computer program that is capable of executing a query based on a query indicator to selectively retrieve data from, for example,metamodel data 106. - The
network connection Network connections network connections network connections Network connections -
System 100 for querying metamodel data may be applicable to any use that includes querying data stored or viewed in a hierarchical structure, such asmetamodel data 106 or any other form of data organized according to a structure or schema. Althoughsystem 100 is described in this example as a client-server based system,system 100 may be implemented with any other computer architecture or framework. Moreover, althoughFIG. 1 depicts only asingle client 102,metamodel data 106,server 104, and user interface 110, a plurality of such elements may be implemented. -
FIG. 2 shows a flow chart includingexemplary steps 200 for querying metamodel data. Referring toFigs. 1 and2 ,server 104 may receive a query indicator from user interface 110 (step 202). The query indicator defines the type of query to be performed onmetamodel data 106 and includes the value being queried inmetamodel data 106. In various embodiments the query indicator defines the type of query to be performed as a recursive query, a reverse query, or a relationship query, all of which are described further below with respect toFigs. 3-5 . Moreover, the query indicator may include a value, such as a part number, to be queried in themetamodel data 106.Server 104 may then perform the query ofmetamodel data 106 using the query indicator and the value received instep 204. Once the query identifies a result (e.g., finds the value in the meta model data 106),server 104 may then provide any results from the query to user interface 110 at client 102 (step 206). - In
step 202,server 104 may receive the query indicator fromclient 102 and/or user interface 110 throughnetwork connection 112a. The query indicator may be received as part of a SOAP (Simple Object Access Protocol) message from user interface 110; however any other approach may be used to communicate the query indicator from user interface 110 toserver 104 andapplication 108. The query indicator may be implemented as a notation that is used to define the type of query to be performed byserver 104 onmetamodel data 106. In particular, the query indicator species a recursive query, a reverse query, or a relationship query, all of which are described further below with respect toFigs. 3-5 . In some cases, the query indicator is formatted to be consistent with XPath or any other notation system that allows retrieval of metamodel data or any other data stored in accordance with a schema or structure. In addition to the query indicator, user interface 110 may also provide the value to be queried inmetamodel data 106. For example, a user at user interface 110 may initiate a query ofmetamodel data 106 by providing to user interface 110 a query indicator specifying the type of query to be performed, such as a recursive query, onmetamodel data 106 and by including the value, such as "part # 102," to be queried and identified inmetamodel data 106. In this example,application 108 atserver 104 receives the query indicator and value, i.e., recursive query forpart # 102. - To perform a query (step 204),
server 104 may invokeapplication 108. Once invoked,application 108queries metamodel data 106 based on the query indicator. For example, if the query indicator corresponds to a recursive query,application 108 may search a first set of parent and child nodes ofmetamodel data 106 for a value and recursively querymetamodel data 106 until the value is identified. If the query indicator corresponds to a reverse query,application 108 may search child nodes until-a-result is obtained and then identify the parent node for that child node. If the query indicator corresponds to a relationship query,application 108 may search all nodes according to the named relationships between parent and child nodes defined in the metamodel data. The recursive query, reverse query, and relationship queries are each described further below. - Any results of the query are provided by
server 104 toclient 102 and/or user interface 110 for presentation to a user (step 206). Moreover,server 104 may provide the results toclient 102 and/or user interface 110 in the form of a message, such as a SOAP message. In some implementations, any results of the query may be used as input to additional executions of themethod 200 or as input to other computer-implemented processes. - The following examples further illustrate the use of a query indicator to implement either a recursive query, reverse query, or relationship query on data, such as
metamodel data 106. - Recursive Query
- To perform a query of
metamodel data 106,application 108 may begin queryingmetamodel data 106.Application 108 may call itself to complete the query ofmetamodel data 106. This type of query is considered a recursive query. By calling itself to complete the query,application 108 is queryingmetamodel data 106 recursively. Recursion refers to a technique where a function, such as a query, calls itself in order to accomplish a task. System and methods consistent with the present invention may implement a query indicator to define that a recursive query of data, such asmetamodel data 106, should be accomplished. - The use of a recursive query can be illustrated by example.
FIG. 3 shows a portion ofexemplary metamodel data 300, which may be included withinmetamodel data 106.Metamodel data 300 includes, for example,components 302a-f, such aspart # 4145,part # 106,part # 391,part # 0003,part # 789, andpart # 86, all of which are parts included within aproduct # 395 324. Moreover,product 324 may be considered a parent node with associated child nodes corresponding tocomponents 302a-f with a relationship named "ContainedParts". Themetamodel data 300 may include, for example, all of the products (parent nodes) made by an exemplary company. Themetamodel data 300 may also include, for example, all of the components which are used to manufacture each product (child nodes). These components may be discrete parts (such as abrass screw 302a, aplastic tube 320 or a wooden stick 312) or subassemblies (e.g., 302b, 306, and 307), that is products made from other components. Examples of subassemblies might include a motor, a mechanical door, and a fuel filter. The subassemblies may be implemented as products in themetamodel data 300. For example,Product # 1 308 is made up of fourcomponents Part # 3993, a Rubber Plunger, andPart # 0291, a wooden stick. Components indicated by 306 and 307 are subassemblies.Product # 86 306 is a subassembly andProduct # 2961 307 is a subassembly. The components indicated by 306 (Product #86) are also implemented in themetamodel data 300 as aparent node 316 with threecomponents - In order to determine all of the components included within a particular product, such as
product # 1 308,application 108 may first call themetamodel data 300 to query for all of the components ofproduct # 1 308. During the query,application 108 may call itself to make another query for the components ofproduct # 86 306 since that product is a subassembly with corresponding components (i.e., parts of its own). In this example,application 108 makes a call to itself to query for the parts ofproduct # 86, the query identifies component 316 (labeled part #86), which in this case returns components 318-322 (corresponding topart numbers 2033,part # 9910, and part #0003). In the above example, a recursive query is performed whenapplication 108 calls itself to complete the task of querying for all of the components ofproduct # 1 308. - To illustrate another example of a recursive query, suppose a defect was discovered in a brass screw and there was a need to query for every product that contained a brass screw. Beginning with
product # 1 308,application 108 atserver 104 would perform a recursive query, as described above with respect to step 204, for "brass screw" and thus consider each component in themetamodel data 300 associated withproduct # 1 308 (i.e., every component belowproduct # 1, such ascomponents application 108 would findpart # 3993 310 (a rubber plunger) andpart # 0291 312 (a wooden stick). Neither of these is a brass screw. Next,application 108 would find asubassembly 306, which isproduct # 86. In order to find out what components are used to makeproduct # 86,application 108 determines thatproduct # 86 is a subassembly based on information contained incomponent 306 and then calls itself to query forproduct # 86. That second query identifies product #85 316, which includes components, including abrass screw 322. Using a recursive query,application 108 has thus identified a brass screw atproduct # 86 which is a component ofproduct # 1 308. The positive result identifyingproduct # 1 308, which includes the brass screw (part # 0003 322) as part of product number may be provided touser interface 102 atstep 206. If a product includes a plurality of subassemblies,application 108 would perform a recursive query for each subassembly to identify the related components. - Moreover,
application 108 may query eachproduct metamodel data 300 for a brass screw. Whenapplication 108 evaluatesproduct # 395 324,application 108 may determine thatproduct # 395 324 includes abrass screw 302a. Since this is a positive result,application 108 may stop querying for the brass screw and not continue its query for the brass screw against any remainingcomponents 302b-f. Theapplication 108 has thus identifiedproduct # 395 324 as a product that includes a brass screw and provides the positive result as an output instep 206. - In some implementations,
application 108 may determine thatproduct # 86 316 has already been queried and a brass screw was identified (e.g.,part # 0003 322). When that is the case,application 108 may determine that another query ofproduct # 86 316 is not necessary. - In various embodiments a query indicator is implemented to perform the recursive query (step 204), as described above with respect to
FIG. 3 . Returning to the example above, the following query expression would return a list of products including a "brass screw".indicator enabling application 108 to perform a recursive query until a positive result is found and that no node should be queried more than once. Note that the expression "{SubAssembly/Product/}" describes the recursion and describes that the recursion happens from parent to child to parent to child, and so on (e.g., product to part (subassembly) to product to part and so on). - A more generic expression of the query indicator for recursive query is as follows:
ParentNodeName represents the name of the top level node to be queried ("Product" in the example metamodel data 300); ChildNodeName represents the name of the node to be tested ("Part" in the example 300); Field represents the data field to be tested ("PartName" in the example 300); QueryCriteria represents the value that is being selected ("brass screw" in this example); and ReturnedDatumName represents the data field that is to be included in the output when a positive result is found ("Product Number" in the example above). - Reverse Query
- In another embodiment consistent with the present invention,
application 108 may perform a reverse query of metamodel data using a query indicator. A reverse query would perform a query in a reverse direction (i.e., from a child node to a parent node). -
FIG. 4 shows anexemplary data set 400 which may be included as part ofmetamodel data 106.Metamodel data 400 includes parent nodes, such ascustomers 410a-c and child nodes, such assales orders 402a-g. Each parent node, such ascustomer 410a, may be associated with one or more child nodes, such assales orders 402a-b. This relationship may be given a name such as "ExecutedOrders" Moreover, child nodes, such aschild node 402a, may also be associated with corresponding child nodes, such aspart numbers 404a-b. This relationship may be given a name such as "ShippedParts"Parent node 410a andchild nodes 402a-b as well aschild nodes 404a-g may be considered a first set of parent and child nodes; andparent node 410b andchild nodes 402c-d as well aschild nodes 430a-c may be considered another set of parent and child nodes. To perform a reverse query,application 108 would query all parts to identify all customers that ordered that part. This is an example of a reverse query sinceapplication 108 would begin the query at the child node, such asparts 404a-g, and then identify any parent nodes, such ascustomer node 410a, having that part. - By way of example, suppose a company elected to promote an add-on product to every customer who had ordered
part # 687. Instead of starting with the sales order and testing each part to determine ifpart # 687 was included,application 108 may perform the query (e.g., step 204) on all of the child nodes, which in this example corresponds toparts 404a-g. Whenapplication 108 identifiespart # 687,application 108 would traverse up the relationship betweenpart # 404a throughsales order 402a to identifycustomer 410a. In this example, the reverse query would querypart # 687 atnodes 404a and identifyparent node 410a (labeled "Joe Blow"),query part # 687 atnode 406a and identifyparent node 410c (labeled "Suzy Queue"), and querypart # 687 atnode 408a and identifyparent node 410c (labeled "Suzy Queue"). In some implementations,application 108 ceases searching for parts associated with a parent node when a positive outcome is determined. For example, whenapplication 108 queries forpart # 687 and findsnode 406a,node 406b may not be searched. Instead, application may proceed to query other child nodes. - In an embodiment consistent with aspects of the present invention, a query indicator is implemented to perform a reverse query (step 204), as described above with respect to
FIG. 4 . Theapplication 108 may perform a reverse query from a child node to a parent node and cease the query of the child nodes associated with that parent node when there is a positive result to the query. Returning to the example above,application 108 may implement the following query expression and would return any parent nodes, such ascustomers 410a-c, who had sales orders including part #687:indicator enabling application 108 to perform a reverse query of metamodel data. - The following provides a more generic query indicator to invoke a reverse query on a metamodel data:
where RelationshipName represents the name of Parent Node/Child Node set to be queried ("ShippedParts" in the example 400); ChildNodeName represents the name of the data field to be tested ("Part" in the example of metamodel data 400); QueryCriteria represents the value that is being selected ("Part # 687" in the example metamodel data 400); and ReturnedDatumName represents the data field that is to be included in the output when a positive result is found ("Customer Name" in the example metamodel data 400). - Relationship query
- In another embodiment consistent with the present invention,
application 108 may perform an a relationship query of metamodel data using a query indicator. A relationship query may be used to query metamodel data using named relationships.FIG. 5 showsexemplary metamodel data 500, which may be included as part of sourcemetamodel data 106.Metamodel data 500 includes data about production orders. It shows parent nodes, such ascustomers 502a-b, and child nodes, such assales orders 506a-b,corporate address 510a-b,billing address 504a-d, anddelivery address 520a. The solid lines between the nodes depict relationships defined as part of the metamodel data. - By way of example,
application 108 may implement a relationship query to querymetamodel data 500. For example, suppose there was a new tax law introduced in California. In order to determine its impact on a company, the accounting department might need a list of all things related to an address in the State of California. It might be understandable to retrieve customers with headquarters or billing addresses in California. However, it might also be necessary to identify every customer who had facilities or a subsidiary in California. Similarly, there may be a need to include parts that were delivered in California or installed there regardless of company address. Alternative approaches to querying this data would have required each and every parent-child relationship to have its own query expression. A relationship query, however, allows a search of the entire metamodel with reference to specific named relationships. For example, instead of requiring each and every relationship between a parent node and a child node (and a grandchild node and a great-grand-child node) to be iterated in the query, the single relationship between any two nodes can be named and then referred to by that name in the query. - In the given
metamodel data 500, the following query expression would return a list of all things related to an address in the State of California:
where the notation "//*" (or two forward slashes adjacent to an asterisk) represent the queryindicator enabling application 108 to perform a relationship query ofmetamodel data 500 and search all of the relationships in the metamodel. The notation "/" indicates that the datum to be returned is within one level of (or immediately related or connected to) the address in which "State=California". - A more generic expression of this example of the method is as follows:
where ChildNodeType defines the type of node in which the query criteria must be found (Address in the example) and QueryCriteria is the value that is being selected or question that is being asked (State="California" in the example). - As an alternative example, in the given
metamodel data 500, the following query expression would return a list of all orders billed to an address in the State of California:
where the notation "<BillAdd>" (or angled brackets containing the relationship name) represents the queryindicator enabling application 108 to perform a relationship query ofmetamodel data 500 and search the "BillAdd" relationship in the metamodel. - A more generic expression of this example of the method is as follows:
where RelationshipName defines the relationship in which the query criteria must be found (BillAdd in the example) and QueryCriteria is the value that is being selected or question that is being asked (State="California" in the example). - Any step of the method may be implemented with hardware, firmware, or software. Software may be web-based, written in any programming language, or utilize graphical user interfaces. Potential tools and technologies for implementing each step may become apparent to persons skilled in the art through further study of this disclosure. Components of this system, including storage of data and software may reside on any one or more computer-readable medium.
- The systems and methods disclosed herein may be embodied in various forms including, for example, a data processor, such as a computer that also includes a database, digital electronic circuitry, firmware, software, or in combinations of them. Moreover, the above-noted features and other aspects and principles of the present invention may be implemented in various environments. Such environments and related applications may be specially constructed for performing the various processes and operations according to the invention or they may include a general-purpose computer or computing platform selectively activated or reconfigured by code to provide the necessary functionality. The processes disclosed herein are not inherently related to any particular computer, network, architecture, environment, or other apparatus, and may be implemented by a suitable combination of hardware, software, and/or firmware. For example, various general-purpose machines may be used with programs written in accordance with teachings of the invention, or it may be more convenient to construct a specialized apparatus or system to perform the required methods and techniques.
- The systems and methods disclosed herein may be implemented as a computer program product, i.e., a computer program tangibly embodied in an information carrier, e.g., in a machine readable storage device, memory, or in a propagated signal, for execution by, or to control the operation of, data processing apparatus, e.g., a programmable processor, a computer, or multiple computers. A computer program can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program can be deployed to be executed on one computer or on multiple computers at one site or distributed across multiple sites and interconnected by a communication network.
- It will be apparent to those skilled in the art that various modifications and variations can be made to the system and method. For example, although
Figs. 3-5 depict specific types of metamodel data, systems and methods consistent with the present invention may be used with any other data. Other embodiments will be apparent to those skilled in the art from consideration of the specification and practice of the disclosed system and method. In addition, there are likely to be other benefits of this system as yet not understood. It is intended that the specification and examples be considered as exemplary only with a true scope being indicated by the following claims and their equivalents.
Claims (12)
- A method for querying metamodel data (106, 300, 400, 500), the metamodel data (106, 300, 400, 500) forming sets of parent and child nodes (302, 306, 307, 308, 310, 312, 316, 318, 320, 323, 324, 402, 404, 406, 408, 410, 430, 502, 504, 506, 510, 520, 560) comprising:receiving, at a computer (104), a query indicator, the query indicator defining a type of query for a value in the metamodel data (106, 300, 400, 500) and including the value being queried in the metamodel data (106, 300, 400, 500);performing, based on the query indicator, the query for the value by eithera) searching a set of parent and child nodes (302, 306, 307, 308, 310, 312, 316, 318, 320, 323, 324) and recursively querying the metamodel data (300) to identify the value in another set of parent and child nodes (302, 306, 307, 308, 310, 312, 316, 318, 320, 323, 324), wherein an application (108) performing the query calls the application (108) itself when performing the recursive query; orb) searching a set of parent and child nodes (402, 404, 406, 408, 410, 430) and reverse querying the metamodel data (400) to identify the value of the parent node based on the child node, wherein an application (108) performing the query begins the query at a child node and then identifies any parent node; orc) querying the metamodel data (500) using named relationships to identify the value in a set of parent and child nodes (502, 504, 506, 510, 520, 560); andproviding, as a result, the value and at least one of the nodes from the respective sets of parent and child nodes (302, 306, 307, 308, 310, 312, 316, 318, 320, 323, 324, 402, 404, 406, 408, 410, 430, 502, 504, 506, 510, 520, 560).
- The method of claim 1, wherein, in the case of performing query a), receiving the query indicator further comprises receiving the query indicator in the form of a left curly brace.
- The method of claim 1, wherein, in the case of performing query a), receiving the query indicator further comprises receiving the query indicator in the form of a right curly brace.
- The method of any one of the preceding claims, wherein providing the value further comprises providing the value to a user interface (110).
- The method of any one of the preceding claims, wherein, in the case of performing query a), recursively querying the metamodel data (300) ceases when a positive result is found.
- The method of any one of the preceding claims, wherein the metamodel data (106, 300, 400, 500) includes data stored in a database.
- The method of claim 1, wherein, in the case of performing query b), receiving the query indicator further comprises receiving the query indicator in the form of a greater-than sign.
- The method of claim 1, wherein, in the case of performing query b), receiving the query indicator further comprises receiving the query indicator in the form of a less-than sign.
- The method of any one of claims 7 or 8, wherein performing the query ceases when a positive result is found.
- The method of claim 1, wherein, in the case of performing query c), receiving the query indicator further comprises receiving the query indicator in the form of at least a forward slash and an asterisk (/*).
- The method of claim 1, wherein, in the case of performing query c), receiving the query indicator further comprises receiving the query indicator in the form of at least a backward slash and an asterisk ( ).
- The method of any one of claims 10 or 11, wherein receiving the query indicator further comprises receiving the query indicator in the form of at least a less-than sign, a relationship name and a greater-than sign.
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/485,363 US7702689B2 (en) | 2006-07-13 | 2006-07-13 | Systems and methods for querying metamodel data |
Publications (2)
Publication Number | Publication Date |
---|---|
EP1879120A1 EP1879120A1 (en) | 2008-01-16 |
EP1879120B1 true EP1879120B1 (en) | 2013-05-22 |
Family
ID=38525487
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP07013708.8A Active EP1879120B1 (en) | 2006-07-13 | 2007-07-12 | Systems and methods for querying metamodel data |
Country Status (2)
Country | Link |
---|---|
US (1) | US7702689B2 (en) |
EP (1) | EP1879120B1 (en) |
Families Citing this family (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20080140623A1 (en) * | 2006-12-11 | 2008-06-12 | Microsoft Corporation | Recursive reporting via a spreadsheet |
US8315990B2 (en) * | 2007-11-08 | 2012-11-20 | Microsoft Corporation | Consistency sensitive streaming operators |
US20100088325A1 (en) * | 2008-10-07 | 2010-04-08 | Microsoft Corporation | Streaming Queries |
US10346483B2 (en) * | 2009-10-02 | 2019-07-09 | Akamai Technologies, Inc. | System and method for search engine optimization |
US9158816B2 (en) | 2009-10-21 | 2015-10-13 | Microsoft Technology Licensing, Llc | Event processing with XML query based on reusable XML query template |
US8413169B2 (en) * | 2009-10-21 | 2013-04-02 | Microsoft Corporation | Time-based event processing using punctuation events |
US9646164B2 (en) | 2010-12-30 | 2017-05-09 | Aziomatics Ab | System and method for evaluating a reverse query |
SE1051394A1 (en) * | 2010-12-30 | 2011-10-13 | Axiomatics Ab | A system and method for evaluating a reverse query |
WO2013070673A1 (en) | 2011-11-08 | 2013-05-16 | Google Inc. | Systems and methods for generating and displaying hierarchical search results |
US8966576B2 (en) | 2012-02-27 | 2015-02-24 | Axiomatics Ab | Provisioning access control using SDDL on the basis of a XACML policy |
US9367536B2 (en) * | 2013-05-03 | 2016-06-14 | Facebook, Inc. | Using inverse operators for queries on online social networks |
US9367625B2 (en) | 2013-05-03 | 2016-06-14 | Facebook, Inc. | Search query interactions on online social networks |
US9367880B2 (en) | 2013-05-03 | 2016-06-14 | Facebook, Inc. | Search intent for queries on online social networks |
US10384787B2 (en) * | 2016-06-23 | 2019-08-20 | Honeywell International Inc. | Forming an air data probe from a porous cover and brazing material |
CN109255006A (en) * | 2018-09-27 | 2019-01-22 | 广州力挚网络科技有限公司 | A kind of hot spot display methods and device |
WO2023148518A1 (en) * | 2022-02-02 | 2023-08-10 | Featurespace Limited | Storing and searching for data in data stores |
Family Cites Families (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5799325A (en) * | 1993-11-19 | 1998-08-25 | Smartpatents, Inc. | System, method, and computer program product for generating equivalent text files |
US6219670B1 (en) * | 1998-02-18 | 2001-04-17 | International Business Machines Corporation | Method and apparatus for filtering a table list before opening with a graphical user interface |
US6279007B1 (en) * | 1998-11-30 | 2001-08-21 | Microsoft Corporation | Architecture for managing query friendly hierarchical values |
US6567812B1 (en) * | 2000-09-27 | 2003-05-20 | Siemens Aktiengesellschaft | Management of query result complexity using weighted criteria for hierarchical data structuring |
US6804662B1 (en) * | 2000-10-27 | 2004-10-12 | Plumtree Software, Inc. | Method and apparatus for query and analysis |
CA2429633A1 (en) * | 2000-11-16 | 2002-05-30 | Ciphergen Biosystems, Inc. | Method for analyzing mass spectra |
US20020129026A1 (en) * | 2001-03-09 | 2002-09-12 | Reardon Patrick O. | Process for accessing information via a communications network |
JP3847644B2 (en) * | 2002-03-19 | 2006-11-22 | 株式会社ジャストシステム | Design support apparatus, design support method, and program |
US20040098380A1 (en) * | 2002-11-19 | 2004-05-20 | Dentel Stephen D. | Method, system and apparatus for providing a search system |
US20050278368A1 (en) * | 2004-06-08 | 2005-12-15 | Benedikt Michael A | System and method for XML data integration |
US7599924B2 (en) | 2004-06-25 | 2009-10-06 | International Business Machines Corporation | Relationship management in a data abstraction model |
US7702725B2 (en) | 2004-07-02 | 2010-04-20 | Hewlett-Packard Development Company, L.P. | Digital object repositories, models, protocol, apparatus, methods and software and data structures, relating thereto |
-
2006
- 2006-07-13 US US11/485,363 patent/US7702689B2/en active Active
-
2007
- 2007-07-12 EP EP07013708.8A patent/EP1879120B1/en active Active
Also Published As
Publication number | Publication date |
---|---|
US7702689B2 (en) | 2010-04-20 |
EP1879120A1 (en) | 2008-01-16 |
US20080016033A1 (en) | 2008-01-17 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1879120B1 (en) | Systems and methods for querying metamodel data | |
Farquhar et al. | Collaborative ontology construction for information integration | |
US10097597B2 (en) | Collaborative workbench for managing data from heterogeneous sources | |
US7606829B2 (en) | Model entity operations in query results | |
US8719287B2 (en) | Apparatus and method for dynamically selecting componentized executable instructions at run time | |
Morel et al. | The REBOOT environment (software reuse) | |
US8356046B2 (en) | Context-based user interface, search, and navigation | |
US8996552B2 (en) | System and method for graphically creating queries on model data | |
US20050210000A1 (en) | Semantic web portal graphic interface | |
WO2000075849A2 (en) | Method and apparatus for data access to heterogeneous data sources | |
Shestakov et al. | DEQUE: querying the deep web | |
US20080086683A1 (en) | Reporting engine for object relational networks | |
Schwabe et al. | Design and Implementation of Semantic Web Applications. | |
US8812550B2 (en) | Systems, methods and apparatus for assessing compliance and federating databases | |
Gulić | Transformation of OWL ontology sources into data warehouse | |
Perez et al. | Corporate memory management through agents | |
Yao et al. | Asynchronous information space analysis architecture using content and structure-based service brokering | |
Pincus et al. | Contextualizing heterogeneous data for integration and inference | |
Digles et al. | Accessing the open PHACTS discovery platform with workflow tools | |
Catanio et al. | Ubiquitous Metainformation and the WYWWYWI Principle | |
Bhaumik et al. | Towards hypermedia support for database systems | |
Grubb et al. | Inside an environmental data archive WWW site | |
宗像浩一 et al. | Studies on integration of heterogeneous information sources | |
Faulstich et al. | Building HyperView wrappers for publisher Web sites | |
Kovalev et al. | HW-STALKER: a machine learning-based approach to transform hidden web data to XML |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC MT NL PL PT RO SE SI SK TR |
|
AX | Request for extension of the european patent |
Extension state: AL BA HR MK YU |
|
17P | Request for examination filed |
Effective date: 20080715 |
|
AKX | Designation fees paid |
Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC MT NL PL PT RO SE SI SK TR |
|
17Q | First examination report despatched |
Effective date: 20120327 |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC MT NL PL PT RO SE SI SK TR |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: EP |
|
REG | Reference to a national code |
Ref country code: AT Ref legal event code: REF Ref document number: 613564 Country of ref document: AT Kind code of ref document: T Effective date: 20130615 |
|
REG | Reference to a national code |
Ref country code: IE Ref legal event code: FG4D |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R096 Ref document number: 602007030534 Country of ref document: DE Effective date: 20130718 |
|
REG | Reference to a national code |
Ref country code: AT Ref legal event code: MK05 Ref document number: 613564 Country of ref document: AT Kind code of ref document: T Effective date: 20130522 |
|
REG | Reference to a national code |
Ref country code: LT Ref legal event code: MG4D |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: FI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130522 Ref country code: SE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130522 Ref country code: IS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130922 Ref country code: PT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130923 Ref country code: ES Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130902 Ref country code: SI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130522 Ref country code: LT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130522 Ref country code: GR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130823 Ref country code: AT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130522 |
|
REG | Reference to a national code |
Ref country code: NL Ref legal event code: VDEP Effective date: 20130522 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: BG Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130822 Ref country code: PL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130522 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LV Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130522 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: CZ Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130522 Ref country code: SK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130522 Ref country code: EE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130522 Ref country code: BE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130522 Ref country code: DK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130522 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130522 Ref country code: RO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130522 Ref country code: NL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130522 Ref country code: MC Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130522 |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: PL |
|
PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
REG | Reference to a national code |
Ref country code: IE Ref legal event code: MM4A |
|
26N | No opposition filed |
Effective date: 20140225 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: CH Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20130731 Ref country code: LI Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20130731 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R097 Ref document number: 602007030534 Country of ref document: DE Effective date: 20140225 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20130712 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R082 Ref document number: 602007030534 Country of ref document: DE Representative=s name: MUELLER-BORE & PARTNER PATENTANWAELTE PARTG MB, DE |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R081 Ref document number: 602007030534 Country of ref document: DE Owner name: SAP SE, DE Free format text: FORMER OWNER: SAP AG, 69190 WALLDORF, DE Effective date: 20141210 Ref country code: DE Ref legal event code: R082 Ref document number: 602007030534 Country of ref document: DE Representative=s name: MUELLER-BORE & PARTNER PATENTANWAELTE PARTG MB, DE Effective date: 20141210 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: CY Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130522 Ref country code: TR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130522 Ref country code: MT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20130522 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: HU Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO Effective date: 20070712 Ref country code: LU Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20130712 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 10 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 11 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 12 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R079 Ref document number: 602007030534 Country of ref document: DE Free format text: PREVIOUS MAIN CLASS: G06F0017300000 Ipc: G06F0016000000 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: GB Payment date: 20230720 Year of fee payment: 17 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: FR Payment date: 20230725 Year of fee payment: 17 Ref country code: DE Payment date: 20230719 Year of fee payment: 17 |