US20210224294A1 - Hierarchical data - Google Patents
Hierarchical data Download PDFInfo
- Publication number
- US20210224294A1 US20210224294A1 US16/745,582 US202016745582A US2021224294A1 US 20210224294 A1 US20210224294 A1 US 20210224294A1 US 202016745582 A US202016745582 A US 202016745582A US 2021224294 A1 US2021224294 A1 US 2021224294A1
- Authority
- US
- United States
- Prior art keywords
- ast
- query
- parent node
- parent
- recited
- 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.)
- Granted
Links
- 238000012545 processing Methods 0.000 claims abstract description 60
- 230000003190 augmentative effect Effects 0.000 claims abstract description 40
- 238000004590 computer program Methods 0.000 claims abstract description 31
- 238000000034 method Methods 0.000 abstract description 55
- 238000010586 diagram Methods 0.000 description 16
- 230000008569 process Effects 0.000 description 15
- 230000006870 function Effects 0.000 description 11
- 238000004891 communication Methods 0.000 description 6
- 230000003416 augmentation Effects 0.000 description 5
- 230000005540 biological transmission Effects 0.000 description 5
- 230000008901 benefit Effects 0.000 description 4
- 238000013500 data storage Methods 0.000 description 4
- 238000011156 evaluation Methods 0.000 description 3
- 238000007781 pre-processing Methods 0.000 description 3
- 238000003491 array Methods 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 230000010354 integration Effects 0.000 description 2
- 238000002372 labelling Methods 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000001902 propagating effect Effects 0.000 description 2
- 230000009466 transformation Effects 0.000 description 2
- RYGMFSIKBFXOCR-UHFFFAOYSA-N Copper Chemical compound [Cu] RYGMFSIKBFXOCR-UHFFFAOYSA-N 0.000 description 1
- 241000254158 Lampyridae Species 0.000 description 1
- 239000008186 active pharmaceutical agent Substances 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000027455 binding Effects 0.000 description 1
- 238000009739 binding Methods 0.000 description 1
- 229910052802 copper Inorganic materials 0.000 description 1
- 239000010949 copper Substances 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000001131 transforming effect 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/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2246—Trees, e.g. B+trees
-
- 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/242—Query formulation
- G06F16/2433—Query languages
- G06F16/2448—Query languages for particular applications; for extensibility, e.g. user defined types
-
- 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
- G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
-
- 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/28—Databases characterised by their database models, e.g. relational or object models
- G06F16/282—Hierarchical databases, e.g. IMS, LDAP data stores or Lotus Notes
-
- 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/901—Indexing; Data structures therefor; Storage structures
- G06F16/9024—Graphs; Linked lists
Definitions
- Embodiments of the present invention relate generally to hierarchical data, and more particularly to concepts for identifying ancestor objects in hierarchical data.
- Embodiments of the present invention also relate to concepts for processing hierarchical data with a query according to a query language. Such concepts may be computer-implemented.
- embodiments of the present invention also relate to a computer program product comprising computer-readable program code that enables a processor of a system, or a number of processors of a network, to implement such a method.
- embodiments of the present invention further relate to a system for identifying ancestor objects in hierarchical data configured for processing with a query according to a query language.
- embodiments of the present invention further relate to a system for processing hierarchical data with a query according to a query language.
- Structured data query languages such as)(Path (an eXtensible Markup Language (XML) query language), comprise syntax that allows a user to find the ‘parent’ element of any other element within a data structure. This is possible because the input data (e.g., XML in the case of using)(Path) will have been specially parsed to contain fully interconnected relationship information in the parsed input structure. Thus, the query engine simply needs to traverse this parsed input structure when a parent element is requested.
- XML eXtensible Markup Language
- the above approach relies on the data been pre-prepared to contain the relationship information. Pre-preparing the input data adds extra CPU overhead to query evaluation. Also, creating a copy of the data with the extra relationship metadata consumes significantly more memory, and has to be done for every invocation of a query.
- the query engine is not able to identify the ‘parent’ of an arbitrary data within the data structure (because the relationship information is not available).
- Embodiments of the present invention seek to provide a method for identifying ancestor objects in hierarchical data configured for processing with query according to a query language.
- Embodiments of the present invention also seek to provide a method for processing hierarchical data with a query according to a query language, the query having an associated abstract syntax tree, AST.
- Embodiments of the present invention further seek to provide a computer program product including computer program code for implementing a proposed method when executed by a processing unit.
- Embodiments of the present invention also seek to provide a processing system adapted to execute this computer program code.
- Embodiments of the present invention yet further seek to provide a system for identifying ancestor objects in hierarchical data configured for processing with query according to a query language. Further, embodiments of the present invention seek to provide a system for processing hierarchical data with a query according to a query language.
- a computer-implemented method for identifying ancestor objects in hierarchical data configured for processing with query according to a query language, the query having an associated abstract syntax tree, AST.
- the method comprises processing the AST associated with the query to determine a parent node of the AST relating to the query.
- the method also comprises augmenting the AST with a parent identifier configured to identify the determined parent node so as to generate an augmented AST.
- Proposed concepts may provide for a query language to determine the parent, or any higher level ancestor, for any data item within a hierarchical data structure without needing the hierarchical information (e.g., parent relationship information) to be encoded into the data itself. Rather, embodiments propose that the parse tree of the query language itself is post-processed and augmented with appropriate information.
- Proposed embodiments may therefore provide the advantage that processing a query's AST may be done as part of query compilation, and thus may need only done once, whereas the evaluation of the compiled query might be undertaken numerous times.
- Embodiments may also have the advantage that the preprocessing of the query will not be affected by data size.
- embodiments may eliminate a need to pre-parse the input data.
- embodiments may alleviate a need to pre-prepare the input data to include relationship information.
- processing the AST associated with the query to determine a parent node of the AST relating to the query may comprise traversing the AST to determine a node of the AST that represents a parent node of the query. In this way, a simple process of stepping through the path(s) of the AST may be employed in order to identify a parent node in a computationally efficient manner.
- the parent identifier may be configured to instruct a query processor to save a reference to the parent node.
- an embodiment may be configured to instruct a query processor to save a reference to a requested parent in a suitable storage mechanism so that it is available later in the query when the ancestor is actually requested.
- augmenting the AST with a parent identifier configured to identify the determined parent node so as to generate an augmented AST may comprise adding an ancestor attribute to the parent node of the AST.
- embodiments may pre-process the AST to add metadata to the relevant parts.
- adding an ancestor attribute to the parent node of the AST may comprise setting a value of the ancestor attribute to a predetermined value.
- the predetermined value may be based on a counter value, the counter value being incremented for each parent node that is identified.
- Use of a counter value may, for example, support a simple counting method for identifying corresponding parent nodes in a hierarchy with multi-level ancestry.
- Some embodiments may further comprise the preceding step of generating the AST by parsing the query.
- embodiments may include generating the AST, whereas other embodiments may be configured to process a pre-existing AST (e.g., an AST that has been previously generated by a separate system/method).
- Proposed embodiments may further comprise: storing the augmented AST; and associating the stored augmented AST with the hierarchical data.
- embodiments may be configured provide a query resource that is available for use when a query is later evaluated (potentially many times). A query may therefore only need to be processed once according to proposed concepts, whereas it may be evaluated numerous times.
- the hierarchical data may comprise JSON data and the query language may then be a JSONata query language (JSON query and transformation language).
- JSON query and transformation language JSON query and transformation language
- a computer-implemented method for processing hierarchical data with a query according to a query language the query having an associated abstract syntax tree, AST.
- the method comprises identifying ancestor objects in hierarchical data according to a proposed embodiment.
- the method then also comprises evaluating the query by processing the augmented AST against the hierarchical data.
- the computer program product comprises a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processing unit to cause the processing unit to perform a method according to a proposed embodiment.
- a computer system comprising at least one processor and the computer program product according to an embodiment. At least one processor is adapted to execute the computer program code of said computer program product.
- system for identifying ancestor objects in hierarchical data configured for processing with query according to a query language, the query having an associated AST.
- the system comprises a processing unit configured to process the AST associated with the query to determine a parent node of the AST relating to the query.
- the system also comprises an augmentation component configured to augment the AST with a parent identifier configured to identify the determined parent node so as to generate an augmented AST.
- a system for processing hierarchical data with a query according to a query language the query having an associated AST.
- the system comprises a system for identifying ancestor objects in hierarchical data according to a proposed embodiment.
- the system also comprises a processor arrangement configured to evaluate the query by processing the augmented AST against the hierarchical data.
- FIG. 1 depicts a pictorial representation of an example distributed system in which aspects of the illustrative embodiments may be implemented in accordance with an embodiment of the present invention
- FIG. 2 is a schematic diagram of a proposed system for identifying ancestor objects in hierarchical data according to an embodiment of the present invention
- FIG. 3 is a flow diagram of a computer-implemented method for identifying ancestor objects in hierarchical data according to an embodiment of the present invention
- FIG. 4 is a flow diagram of a computer-implemented method for processing hierarchical data with a query according to an embodiment of the present invention.
- FIG. 5 illustrates a system according to another embodiment of the present invention.
- embodiments of the present invention constitute a method
- a method may be a process for execution by a computer, i.e., may be a computer-implementable method.
- the various steps of the method may therefore reflect various parts of a computer program, e.g., various parts of one or more algorithms.
- a system may be a single device or a collection of distributed devices that are adapted to execute one or more embodiments of the methods of the present invention.
- a system may be a personal computer (PC), a server or a collection of PCs and/or servers connected via a network such as a local area network, the Internet and so on to cooperatively execute at least one embodiment of the methods of the present invention.
- a component may be an integration flow that is executed by one or more processing units.
- Such concepts may process an AST associated the query so as to generate an augmented AST which includes parent identifiers configured to identify the parent nodes of the query. In this way, a need to pre-parse the data may be alleviated. Instead, the identification of a parent node of a query may be encoded into the AST of the query.
- proposed embodiments may pre-process the AST of a data query to add metadata (identifying parent nodes of the query) to the relevant parts of the AST.
- Reference to ‘parent’ should be taken to mean the object of a query that contains the property whose value we currently have a reference to in the query.
- Embodiments may therefore provide concepts for finding ancestor objects in hierarchical data.
- FIG. 1 depicts a pictorial representation of an exemplary distributed system in which aspects of the illustrative embodiments may be implemented.
- a distributed system 100 may include a network of computers in which aspects of the illustrative embodiments may be implemented.
- the distributed system 100 contains at least one network 102 , which is the medium used to provide communication links between various devices and computers connected together within the distributed data processing system 100 .
- the network 102 may include connections, such as wire, wireless communication links, or fiber optic cables.
- first 104 and second 106 servers are connected to the network 102 along with a storage unit 108 .
- clients 110 , 112 , and 114 are also connected to the network 102 .
- the clients 110 , 112 , and 114 may be edge devices, for example, personal computers, network computers, IoT devices, or the like.
- the first server 104 provides data, such as boot files, operating system images, and applications to the clients 110 , 112 , and 114 .
- Clients 110 , 112 , and 114 are clients to the first server 104 in the depicted example.
- the distributed processing system 100 may include additional servers, clients, and other devices not shown.
- the distributed system 100 is the Internet with the network 102 representing a worldwide collection of networks and gateways that use the Transmission Control Protocol/Internet Protocol (TCP/IP) suite of protocols to communicate with one another.
- TCP/IP Transmission Control Protocol/Internet Protocol
- the distributed system 100 may also be implemented to include a number of different types of networks, such as for example, an intranet, a local area network (LAN), a wide area network (WAN), or the like.
- FIG. 1 is intended as an example, not as an architectural limitation for different embodiments of the present invention, and therefore, the particular elements shown in FIG. 1 should not be considered limiting with regard to the environments in which the illustrative embodiments of the present invention may be implemented.
- FIG. 1 may vary depending on the implementation. Also, the processes of the illustrative embodiments may be applied to a multiprocessor data processing system, other than the system mentioned previously, without departing from the scope of the present invention.
- embodiments may take the form of any of a number of different data processing systems including client computing devices, server computing devices, a tablet computer, laptop computer, telephone or other communication device, a personal digital assistant (PDA), or the like.
- a system according to an embodiment may be a portable computing device that is configured with flash memory to provide non-volatile memory for storing operating system files and/or user-generated data, for example.
- a system according to a proposed embodiment may essentially be any known or later-developed data processing system without architectural limitation.
- proposed embodiments provide a method and system for identifying ancestor objects in hierarchical data configured for processing with query according to a query language, the query having an associated abstract syntax tree, AST.
- FIG. 2 there is depicted a schematic diagram of a proposed system 200 for identifying ancestor objects in hierarchical data according to an embodiment.
- the hierarchical data is stored in a database 210 (e.g., remote data store accessible via the Internet) and configured for processing with a query 215 according to a query language.
- the hierarchical data comprises JSON (JavaScript® Object Notation) data and the query language is the JSONata query language (JSON query and transformation language).
- the system 200 comprises a query parser 220 configured to generate an abstract syntax tree, AST, 225 by parsing the query 210 . In this way, the system 200 is configured to generate an AST 225 that is associated with the query 210 .
- the system 200 also comprises a processing unit 230 configured to process the AST 225 associated with the query 210 to determine a parent node of the AST 225 .
- the processing unit 230 comprises a traversal component 235 that is configured to traverse the AST 225 to determine a node of the AST 225 that represents a parent node of the query 215 .
- An augmentation component 240 of the system 200 is configured to augment the AST 225 with a parent identifier that identifies the determined parent node.
- the parent identifier is configured to instruct a query processor to save a reference to the parent node.
- the augmentation component 240 generates an augmented AST 245 (denoted by the “*” in FIG. 2 ).
- the augmentation component 240 comprises an attribute editor 250 that is configured to add an ancestor attribute to the parent node of the AST 225 .
- the attribute editor 250 sets a value of the ancestor attribute to a predetermined value, which in this example is based on a count value that is incremented for each parent node that is identified.
- the system 200 further comprises: a storage component 260 configured to store the augmented AST (e.g., for subsequent access/usage via an Input/Output (I/O) interface of the system 200 ).
- the system 200 also comprises an association component 270 that is configured to associate the stored augmented AST 245 with the hierarchical data 210 .
- a query may have the following expression: Account.Order.Product.!.OrderID
- a conventional expression evaluator will step through the path and apply each step to the input document.
- the first step selects the value associated with the ‘Account’ property in the input data. It then moves to the next step and, using the result of the previous step as the input (context) data, selects the value associated with the ‘Order’ property. This continues for each step until it gets to the ‘!’ token which represents the ‘select parent’ operation. It will now have a problem because the input (context) data (i.e., the value associated with the Product property) does not contain any reference back to the ‘Order’ value.
- the inventors propose a concept of pre-processing the AST to add additional information (e.g., metadata) for identifying parent nodes.
- additional information e.g., metadata
- a uniquely named label may be created, one step counted back, and ‘Product’ step then labelled with the label.
- the resulting augmented AST for the example will then be as follows:
- a query evaluator is then configured to recognize this extra information such that when it processes the ‘Product’ step, it first stores a reference to its input context value (which is the Order value) in a suitable storage mechanism (i.e., hash table) keyed with the label ‘#0’. When it gets to process the parent ‘!’ step, the result of this step will be the value that was earlier stored against label ‘#0’.
- a suitable storage mechanism i.e., hash table
- the value of the output ‘Name’ property will be the value of the ‘ProductName’ property of the input ‘Product’ (context) value.
- the value of the output ‘Order’ property relies on finding the parent of the current Product in order to get its ‘OrderID’ value.
- the complication in this example is that the parent ‘!’ operator is the first step in its sub-path, so it is not as simple as labelling the previous step. Since the function that processes the AST is recursive, when the function returns (and unwinds the stack), if the first step is still searching for its parent, then the search is carried up the stack by adding the property ‘seekingParent: label’ to containing node in the AST (object constructor in this case). Once it has promoted this property to a node which is a step in a containing path, then finds the previous step to label with the ‘ancestor’ property.
- Proposed embodiments may also be configured to cater for any level of ancestor. For example, one may consider the following query expression:
- the expression in the preceding paragraph contains the sub-expression !.!.AccountID which is configured to select the grandparent of the Product. It is proposed to also associate a ‘level’ counter with the ‘seekingParent’ property which is then decremented for every step back it counts, but incremented if that step is a parent ‘!’ operator. When the counter gets to zero, it has found the correct ancestor.
- proposed embodiments may be configured to provide extended functionality in a hierarchical data storage and processing system. Such functionality may be driven by leveraging a concept of pre-processing an AST associated with a query so as to generate an augmented AST which includes information for to identifying the parent nodes of the query.
- FIG. 3 there is shown a flow diagram of a computer-implemented method for identifying ancestor objects in hierarchical data configured for processing with a query according to a query language.
- the query language is the XPath query language.
- XPath has the ability to query parent nodes (and other nodes that precede the current context node. For this reason, XPath assumes that an XML document has been parsed by a DOM parser which creates an interconnected tree of nodes (infoset), each of which includes a link to its parent node.
- the method begins with step 310 of generating an AST by parsing the query.
- Such generation of an AST is well-known and one of many different AST generation processes may be employed in step 310 .
- an AST for the query may be generated using a known parser referred to as a Pratt parser. Parser generator tools may also be used that create the parser code when provided with a formal grammar for the language.
- step 320 the generated AST is processed based on the query so as to determine a parent node of the AST relating to the query.
- processing to determine a parent node of the AST relating to the query comprises the step 325 of traversing the AST to determine a node of the AST that represents a parent node of the query.
- the AST is then augmented with a parent identifier in step 330 .
- augmenting the AST with a parent identifier comprises the step 335 of adding an ancestor attribute to the determined parent node of the AST.
- This includes setting a value of the ancestor attribute to a value based on a counter value.
- the counter value may, for example, be incremented for each parent node that is identified, thus providing a way of discriminating between a plurality of identified parent nodes.
- the parent identifier may be used to instruct a query processor to save a reference to the corresponding parent node.
- the augmented AST is then stored in a data storage component in step 340 .
- a data storage component may be remotely located from the components/system that processed and augmented the AST (for example, via the Internet or a distributed communication network).
- the stored augmented AST is associated with the hierarchical data.
- embodiments may also be applied to an AST representing an XPath expression.
- SAX being a higher performance API for parsing XML documents which emits events as the document is being scanned from start to end without storing any data
- Such a technique could also be extended to apply to all of the other backward looking axes in XPath (ancestor, ancestor-or-self, parent, preceding, preceding-sibling).
- JSONata is a JavaScript® library that is designed for querying and transforming JSON data. It has a location path syntax for navigating JSON structures similar in nature to the XPath syntax for XML data.
- JSONata is a JavaScript® library that is designed for querying and transforming JSON data. It has a location path syntax for navigating JSON structures similar in nature to the XPath syntax for XML data.
- JSONata query expression may then be as follows:
- the dot operator specifies that for each item matched by the left hand side (context), select all items that are matched by the right hand side (functional mapping operation).
- the ‘!’ symbol represents the request to select the parent object of the context.
- the sub-path ‘!.OrderID’ is asking for the OrderID property of the ‘Order’ object, which is the parent (enclosing object) of the Product context object.
- the AST of the parsed query expression is traversed to identify the AST node that represents the part of the query that matches the parent object.
- the augmented AST for the JSONata query expression above is as follows:
- type path steps: - value: Account type: name - value: Order type: name - value: Product ⁇ AST node decorated with an ‘ancestor’ attribute.
- the query evaluation engine when processing this augmented AST against the input data will identify the AST node decorated with the ‘ancestor’ attribute and store its input context item (i.e., the current ‘Order’ value) in the tuple stream that contains the accumulated query results plus any temporary variable bindings. This stored value is then available later when the AST node representing the ‘!’ token is processed, and looked up using the unique ‘slot’ number.
- input context item i.e., the current ‘Order’ value
- FIG. 3 may be leveraged for the purpose of processing hierarchical data with a query.
- a proposed embodiment of a processing hierarchical data with a query according to a query language will now be described with reference to FIG. 4 .
- FIG. 4 there is shown a flow diagram of a computer-implemented method 400 for processing hierarchical data with a query according to a query language.
- the method 400 comprises firstly executing the method 300 of identifying ancestor objects in hierarchical data according to the embodiment of FIG. 3 . Then, in step 410 , the query is evaluated by processing the augmented AST against the hierarchical data.
- Embodiments may comprise a computer system 70 , which may form part of a networked system 7 illustrated in FIG. 5 .
- an augmentation component according to an embodiment may be implemented in the computer system 70 (e.g., as a processing unit 71 ).
- the components of computer system/server 70 may include, but are not limited to, one or more processing arrangements, for example comprising processors or processing units 71 , a system memory 74 , and a bus 90 that couples various system components including system memory 74 to processing unit 71 .
- System memory 74 can include computer system readable media in the form of volatile memory, such as random access memory (RAM) 75 and/or cache memory 76 .
- Computer system/server 70 may further include other removable/non-removable, volatile/non-volatile computer system storage media. In such instances, each can be connected to bus 90 by one or more data media interfaces.
- the memory 74 may include at least one program product having a set (e.g., at least one) of program modules that are configured to carry out the functions of proposed embodiments.
- the memory 74 may include a computer program product having program executable by the processing unit 71 to cause the Input/Output (I/O) interface 72 perform a method for a middleware system of a pub/sub messaging system according to a proposed embodiment.
- Program/utility 78 having a set (at least one) of program modules 79 , may be stored in memory 74 .
- Program modules 79 generally carry out the functions and/or methodologies of proposed embodiments for pub/sub messaging systems.
- Computer system/server 70 may also communicate with one or more external devices 80 such as a keyboard, a pointing device, a display 85 , etc.; one or more devices that enable a user to interact with computer system/server 70 ; and/or any devices (e.g., network card, modem, etc.) that enable computer system/server 70 to communicate with one or more other computing devices. Such communication can occur via Input/Output (I/O) interfaces 72 . Still yet, computer system/server 70 can communicate with one or more networks such as a local area network (LAN), a general wide area network (WAN), and/or a public network (e.g., the Internet) via network adapter 73 (e.g., to communicate determined optimal values of DFWF to edge devices of a distributed network).
- LAN local area network
- WAN wide area network
- public network e.g., the Internet
- embodiments of the present invention constitute a method
- a method is a process for execution by a computer, i.e., is a computer-implementable method.
- the steps of the method therefore reflect various parts of a computer program, e.g., parts of one or more algorithms.
- the present invention may be a system, a method, and/or a computer program product at any possible technical detail level of integration
- the computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present invention
- the computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device.
- the computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing.
- a non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing.
- RAM random access memory
- ROM read-only memory
- EPROM or Flash memory erasable programmable read-only memory
- SRAM static random access memory
- CD-ROM compact disc read-only memory
- DVD digital versatile disk
- memory stick a floppy disk
- a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon
- a computer readable storage medium is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.
- Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network.
- the network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers.
- a network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.
- Computer readable program instructions for carrying out operations of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, configuration data for integrated circuitry, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++, or the like, and procedural programming languages, such as the “C” programming language or similar programming languages.
- the computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server.
- the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
- electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.
- These computer readable program instructions may be provided to a processor of a computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
- These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.
- the computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.
- each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s).
- the functions noted in the blocks may occur out of the order noted in the Figures.
- two blocks shown in succession may, in fact, be accomplished as one step, executed concurrently, substantially concurrently, in a partially or wholly temporally overlapping manner, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved.
Abstract
Description
- Embodiments of the present invention relate generally to hierarchical data, and more particularly to concepts for identifying ancestor objects in hierarchical data. Embodiments of the present invention also relate to concepts for processing hierarchical data with a query according to a query language. Such concepts may be computer-implemented.
- Furthermore, embodiments of the present invention also relate to a computer program product comprising computer-readable program code that enables a processor of a system, or a number of processors of a network, to implement such a method.
- Additionally, embodiments of the present invention further relate to a system for identifying ancestor objects in hierarchical data configured for processing with a query according to a query language. Embodiments of the present invention further relate to a system for processing hierarchical data with a query according to a query language.
- Structured data query languages, such as)(Path (an eXtensible Markup Language (XML) query language), comprise syntax that allows a user to find the ‘parent’ element of any other element within a data structure. This is possible because the input data (e.g., XML in the case of using)(Path) will have been specially parsed to contain fully interconnected relationship information in the parsed input structure. Thus, the query engine simply needs to traverse this parsed input structure when a parent element is requested.
- The above approach relies on the data been pre-prepared to contain the relationship information. Pre-preparing the input data adds extra CPU overhead to query evaluation. Also, creating a copy of the data with the extra relationship metadata consumes significantly more memory, and has to be done for every invocation of a query.
- For cases where the data is not modified to include the relationship information, for example a JavaScript® object structure that natively represents JSON (JavaScript® Object Notation) data, the query engine is not able to identify the ‘parent’ of an arbitrary data within the data structure (because the relationship information is not available).
- Embodiments of the present invention seek to provide a method for identifying ancestor objects in hierarchical data configured for processing with query according to a query language.
- Embodiments of the present invention also seek to provide a method for processing hierarchical data with a query according to a query language, the query having an associated abstract syntax tree, AST.
- Embodiments of the present invention further seek to provide a computer program product including computer program code for implementing a proposed method when executed by a processing unit. Embodiments of the present invention also seek to provide a processing system adapted to execute this computer program code.
- Embodiments of the present invention yet further seek to provide a system for identifying ancestor objects in hierarchical data configured for processing with query according to a query language. Further, embodiments of the present invention seek to provide a system for processing hierarchical data with a query according to a query language.
- According to an embodiment of the present invention, there is provided a computer-implemented method for identifying ancestor objects in hierarchical data configured for processing with query according to a query language, the query having an associated abstract syntax tree, AST. The method comprises processing the AST associated with the query to determine a parent node of the AST relating to the query. The method also comprises augmenting the AST with a parent identifier configured to identify the determined parent node so as to generate an augmented AST.
- Proposed concepts may provide for a query language to determine the parent, or any higher level ancestor, for any data item within a hierarchical data structure without needing the hierarchical information (e.g., parent relationship information) to be encoded into the data itself. Rather, embodiments propose that the parse tree of the query language itself is post-processed and augmented with appropriate information.
- Proposed embodiments may therefore provide the advantage that processing a query's AST may be done as part of query compilation, and thus may need only done once, whereas the evaluation of the compiled query might be undertaken numerous times. Embodiments may also have the advantage that the preprocessing of the query will not be affected by data size.
- By augmenting the AST associated with query with information identifying parent nodes of a query, embodiments may eliminate a need to pre-parse the input data. Put another way, by encoding the identification of one or more parent objects into the AST of the query language, embodiments may alleviate a need to pre-prepare the input data to include relationship information.
- In some embodiments, processing the AST associated with the query to determine a parent node of the AST relating to the query may comprise traversing the AST to determine a node of the AST that represents a parent node of the query. In this way, a simple process of stepping through the path(s) of the AST may be employed in order to identify a parent node in a computationally efficient manner.
- The parent identifier may be configured to instruct a query processor to save a reference to the parent node. In this way, an embodiment may be configured to instruct a query processor to save a reference to a requested parent in a suitable storage mechanism so that it is available later in the query when the ancestor is actually requested.
- In an embodiment, augmenting the AST with a parent identifier configured to identify the determined parent node so as to generate an augmented AST may comprise adding an ancestor attribute to the parent node of the AST. Rather than augment the data with relationship information, which may incur a high computation and/or storage cost (because every value would have to store a hidden reference back to its parent object), embodiments may pre-process the AST to add metadata to the relevant parts.
- For example, adding an ancestor attribute to the parent node of the AST may comprise setting a value of the ancestor attribute to a predetermined value. For instance, the predetermined value may be based on a counter value, the counter value being incremented for each parent node that is identified. Use of a counter value may, for example, support a simple counting method for identifying corresponding parent nodes in a hierarchy with multi-level ancestry.
- Some embodiments may further comprise the preceding step of generating the AST by parsing the query. Thus, it will be understood that embodiments may include generating the AST, whereas other embodiments may be configured to process a pre-existing AST (e.g., an AST that has been previously generated by a separate system/method).
- Proposed embodiments may further comprise: storing the augmented AST; and associating the stored augmented AST with the hierarchical data. In this way, embodiments may be configured provide a query resource that is available for use when a query is later evaluated (potentially many times). A query may therefore only need to be processed once according to proposed concepts, whereas it may be evaluated numerous times.
- The hierarchical data may comprise JSON data and the query language may then be a JSONata query language (JSON query and transformation language). Embodiments may therefore be employed in conjunction with conventional languages and object structures.
- According to another embodiment of the present invention, there is provided computer-implemented method for processing hierarchical data with a query according to a query language, the query having an associated abstract syntax tree, AST. The method comprises identifying ancestor objects in hierarchical data according to a proposed embodiment. The method then also comprises evaluating the query by processing the augmented AST against the hierarchical data.
- According to another embodiment of the present invention, there is provided a computer program product. The computer program product comprises a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processing unit to cause the processing unit to perform a method according to a proposed embodiment.
- According to another embodiment of the present invention, there is provided a computer system comprising at least one processor and the computer program product according to an embodiment. At least one processor is adapted to execute the computer program code of said computer program product.
- According to yet another embodiment of the present invention, there is provided system for identifying ancestor objects in hierarchical data configured for processing with query according to a query language, the query having an associated AST. The system comprises a processing unit configured to process the AST associated with the query to determine a parent node of the AST relating to the query. The system also comprises an augmentation component configured to augment the AST with a parent identifier configured to identify the determined parent node so as to generate an augmented AST.
- According to another embodiment of the present invention, there is provided a system for processing hierarchical data with a query according to a query language, the query having an associated AST. The system comprises a system for identifying ancestor objects in hierarchical data according to a proposed embodiment. The system also comprises a processor arrangement configured to evaluate the query by processing the augmented AST against the hierarchical data.
- The foregoing has outlined rather generally the features and technical advantages of one or more embodiments of the present invention in order that the detailed description of the present invention that follows may be better understood. Additional features and advantages of the present invention will be described hereinafter which may form the subject of the claims of the present invention.
- A better understanding of the present invention can be obtained when the following detailed description is considered in conjunction with the following drawings, in which:
-
FIG. 1 depicts a pictorial representation of an example distributed system in which aspects of the illustrative embodiments may be implemented in accordance with an embodiment of the present invention; -
FIG. 2 is a schematic diagram of a proposed system for identifying ancestor objects in hierarchical data according to an embodiment of the present invention; -
FIG. 3 is a flow diagram of a computer-implemented method for identifying ancestor objects in hierarchical data according to an embodiment of the present invention; -
FIG. 4 is a flow diagram of a computer-implemented method for processing hierarchical data with a query according to an embodiment of the present invention; and -
FIG. 5 illustrates a system according to another embodiment of the present invention. - It should be understood that the Figures are merely schematic and are not drawn to scale. It should also be understood that the same reference numerals are used throughout the Figures to indicate the same or similar parts.
- In the context of the present application, where embodiments of the present invention constitute a method, it should be understood that such a method may be a process for execution by a computer, i.e., may be a computer-implementable method. The various steps of the method may therefore reflect various parts of a computer program, e.g., various parts of one or more algorithms.
- Also, in the context of the present application, a system may be a single device or a collection of distributed devices that are adapted to execute one or more embodiments of the methods of the present invention. For instance, a system may be a personal computer (PC), a server or a collection of PCs and/or servers connected via a network such as a local area network, the Internet and so on to cooperatively execute at least one embodiment of the methods of the present invention. Further, a component may be an integration flow that is executed by one or more processing units.
- Concepts for identifying ancestor (e.g., parent) objects in hierarchical data configured for processing with query are proposed. Such concepts may process an AST associated the query so as to generate an augmented AST which includes parent identifiers configured to identify the parent nodes of the query. In this way, a need to pre-parse the data may be alleviated. Instead, the identification of a parent node of a query may be encoded into the AST of the query.
- For instance, rather than augmenting the data with information about hierarchical relationships (which may be computationally expensive and/or require large amounts of data storage because every value would have to store a hidden reference back to its parent object), proposed embodiments may pre-process the AST of a data query to add metadata (identifying parent nodes of the query) to the relevant parts of the AST.
- Reference to ‘parent’ should be taken to mean the object of a query that contains the property whose value we currently have a reference to in the query.
- Embodiments may therefore provide concepts for finding ancestor objects in hierarchical data.
-
FIG. 1 depicts a pictorial representation of an exemplary distributed system in which aspects of the illustrative embodiments may be implemented. A distributedsystem 100 may include a network of computers in which aspects of the illustrative embodiments may be implemented. The distributedsystem 100 contains at least onenetwork 102, which is the medium used to provide communication links between various devices and computers connected together within the distributeddata processing system 100. Thenetwork 102 may include connections, such as wire, wireless communication links, or fiber optic cables. - In the depicted example, first 104 and second 106 servers are connected to the
network 102 along with astorage unit 108. In addition,clients network 102. Theclients first server 104 provides data, such as boot files, operating system images, and applications to theclients Clients first server 104 in the depicted example. The distributedprocessing system 100 may include additional servers, clients, and other devices not shown. - In the depicted example, the distributed
system 100 is the Internet with thenetwork 102 representing a worldwide collection of networks and gateways that use the Transmission Control Protocol/Internet Protocol (TCP/IP) suite of protocols to communicate with one another. At the heart of the Internet is a backbone of high-speed data communication lines between major nodes or host computers, consisting of thousands of commercial, governmental, educational and other computer systems that route data and messages. Of course, the distributedsystem 100 may also be implemented to include a number of different types of networks, such as for example, an intranet, a local area network (LAN), a wide area network (WAN), or the like. As stated above,FIG. 1 is intended as an example, not as an architectural limitation for different embodiments of the present invention, and therefore, the particular elements shown inFIG. 1 should not be considered limiting with regard to the environments in which the illustrative embodiments of the present invention may be implemented. - Those of ordinary skill in the art will appreciate that the hardware in
FIG. 1 may vary depending on the implementation. Also, the processes of the illustrative embodiments may be applied to a multiprocessor data processing system, other than the system mentioned previously, without departing from the scope of the present invention. - Moreover, embodiments may take the form of any of a number of different data processing systems including client computing devices, server computing devices, a tablet computer, laptop computer, telephone or other communication device, a personal digital assistant (PDA), or the like. In some illustrative examples, a system according to an embodiment may be a portable computing device that is configured with flash memory to provide non-volatile memory for storing operating system files and/or user-generated data, for example. Thus, a system according to a proposed embodiment may essentially be any known or later-developed data processing system without architectural limitation.
- As detailed above, proposed embodiments provide a method and system for identifying ancestor objects in hierarchical data configured for processing with query according to a query language, the query having an associated abstract syntax tree, AST.
- By way of further explanation, a proposed embodiment of such a system will now be described with reference to
FIG. 2 . - Referring to
FIG. 2 , there is depicted a schematic diagram of a proposedsystem 200 for identifying ancestor objects in hierarchical data according to an embodiment. The hierarchical data is stored in a database 210 (e.g., remote data store accessible via the Internet) and configured for processing with aquery 215 according to a query language. Specifically, in this example, the hierarchical data comprises JSON (JavaScript® Object Notation) data and the query language is the JSONata query language (JSON query and transformation language). - The
system 200 comprises aquery parser 220 configured to generate an abstract syntax tree, AST, 225 by parsing thequery 210. In this way, thesystem 200 is configured to generate anAST 225 that is associated with thequery 210. - The
system 200 also comprises aprocessing unit 230 configured to process theAST 225 associated with thequery 210 to determine a parent node of theAST 225. Here, theprocessing unit 230 comprises atraversal component 235 that is configured to traverse theAST 225 to determine a node of theAST 225 that represents a parent node of thequery 215. - An
augmentation component 240 of thesystem 200 is configured to augment theAST 225 with a parent identifier that identifies the determined parent node. The parent identifier is configured to instruct a query processor to save a reference to the parent node. In this exemplary embodiment, theaugmentation component 240 generates an augmented AST 245 (denoted by the “*” inFIG. 2 ). Specifically, theaugmentation component 240 comprises anattribute editor 250 that is configured to add an ancestor attribute to the parent node of theAST 225. Theattribute editor 250 sets a value of the ancestor attribute to a predetermined value, which in this example is based on a count value that is incremented for each parent node that is identified. - The
system 200 further comprises: astorage component 260 configured to store the augmented AST (e.g., for subsequent access/usage via an Input/Output (I/O) interface of the system 200). Thesystem 200 also comprises anassociation component 270 that is configured to associate the storedaugmented AST 245 with thehierarchical data 210. - By way of further example, a query may have the following expression: Account.Order.Product.!.OrderID
- The above query expression will bet parsed into the following abstract syntax tree (AST):
-
- _path_
- Account
- Order
- Product
- ! (parent)
- OrderID
- A conventional expression evaluator will step through the path and apply each step to the input document. The first step selects the value associated with the ‘Account’ property in the input data. It then moves to the next step and, using the result of the previous step as the input (context) data, selects the value associated with the ‘Order’ property. This continues for each step until it gets to the ‘!’ token which represents the ‘select parent’ operation. It will now have a problem because the input (context) data (i.e., the value associated with the Product property) does not contain any reference back to the ‘Order’ value.
- Rather than augment the input data with such relationship information, which would be computationally expensive for example, the inventors propose a concept of pre-processing the AST to add additional information (e.g., metadata) for identifying parent nodes. In the above example, when the parent operator !′ is encountered, a uniquely named label may be created, one step counted back, and ‘Product’ step then labelled with the label. The resulting augmented AST for the example will then be as follows:
-
- _path_
- Account
- Order
- Product (ancestor #0)
- ! (parent #0)
- OrderID
where #0 is the generated label (the number being incremented for other occurrences of ‘!’).
- A query evaluator is then configured to recognize this extra information such that when it processes the ‘Product’ step, it first stores a reference to its input context value (which is the Order value) in a suitable storage mechanism (i.e., hash table) keyed with the label ‘#0’. When it gets to process the parent ‘!’ step, the result of this step will be the value that was earlier stored against label ‘#0’.
- It is to be appreciated that the above example is simple and may not necessarily represent a realistic need for the parent operator. A more practical example may be as follows, which for each Product, will create an object with two properties (‘Name’ and ‘Order’).
-
Account.Order.Product.{ ‘Name’: ProductName, ‘Order’: !.OrderID } - The value of the output ‘Name’ property will be the value of the ‘ProductName’ property of the input ‘Product’ (context) value. The value of the output ‘Order’ property relies on finding the parent of the current Product in order to get its ‘OrderID’ value.
- According to the proposed concept(s), the following augmented AST is generated for the above expression:
-
_path— Account Order Product (ancestor #0) _object_ { ‘Name’ _path— ProductName Order’ _path— ! (parent #0) OrderID } - The complication in this example is that the parent ‘!’ operator is the first step in its sub-path, so it is not as simple as labelling the previous step. Since the function that processes the AST is recursive, when the function returns (and unwinds the stack), if the first step is still searching for its parent, then the search is carried up the stack by adding the property ‘seekingParent: label’ to containing node in the AST (object constructor in this case). Once it has promoted this property to a node which is a step in a containing path, then finds the previous step to label with the ‘ancestor’ property.
- Proposed embodiments may also be configured to cater for any level of ancestor. For example, one may consider the following query expression:
-
Account.Order.Product.{ ′Name′: ProductName, ′Order′: !.OrderID, ‘Account’: !.!.AccountID } - The expression in the preceding paragraph contains the sub-expression !.!.AccountID which is configured to select the grandparent of the Product. It is proposed to also associate a ‘level’ counter with the ‘seekingParent’ property which is then decremented for every step back it counts, but incremented if that step is a parent ‘!’ operator. When the counter gets to zero, it has found the correct ancestor.
- From the above description, it will be appreciated that proposed embodiments may be configured to provide extended functionality in a hierarchical data storage and processing system. Such functionality may be driven by leveraging a concept of pre-processing an AST associated with a query so as to generate an augmented AST which includes information for to identifying the parent nodes of the query.
- By way of further explanation, a proposed embodiment of a method for identifying ancestor objects in hierarchical data will now be described with reference to
FIG. 3 . - Referring to
FIG. 3 , there is shown a flow diagram of a computer-implemented method for identifying ancestor objects in hierarchical data configured for processing with a query according to a query language. In this example, the query language is the XPath query language. XPath has the ability to query parent nodes (and other nodes that precede the current context node. For this reason, XPath assumes that an XML document has been parsed by a DOM parser which creates an interconnected tree of nodes (infoset), each of which includes a link to its parent node. - The method begins with
step 310 of generating an AST by parsing the query. Such generation of an AST is well-known and one of many different AST generation processes may be employed instep 310. Simply by way of example, an AST for the query may be generated using a known parser referred to as a Pratt parser. Parser generator tools may also be used that create the parser code when provided with a formal grammar for the language. - Next, in
step 320, the generated AST is processed based on the query so as to determine a parent node of the AST relating to the query. Specifically, such processing to determine a parent node of the AST relating to the query comprises thestep 325 of traversing the AST to determine a node of the AST that represents a parent node of the query. - The AST is then augmented with a parent identifier in
step 330. Here, augmenting the AST with a parent identifier comprises thestep 335 of adding an ancestor attribute to the determined parent node of the AST. This includes setting a value of the ancestor attribute to a value based on a counter value. The counter value may, for example, be incremented for each parent node that is identified, thus providing a way of discriminating between a plurality of identified parent nodes. In this way, the parent identifier may be used to instruct a query processor to save a reference to the corresponding parent node. - The augmented AST is then stored in a data storage component in
step 340. Such a data storage component may be remotely located from the components/system that processed and augmented the AST (for example, via the Internet or a distributed communication network). Finally, instep 350, the stored augmented AST is associated with the hierarchical data. - Further to the above description, embodiments may also be applied to an AST representing an XPath expression. This would enable an XPath processor to query ancestor nodes in an XML document parsed by a SAX parser (SAX being a higher performance API for parsing XML documents which emits events as the document is being scanned from start to end without storing any data), while avoiding the need to store any additional structural information for the data itself. Such a technique could also be extended to apply to all of the other backward looking axes in XPath (ancestor, ancestor-or-self, parent, preceding, preceding-sibling).
- By way of further explanation, a detailed description of how a proposed method may be implemented will now be provided using the JSONata query language as an example. JSONata is a JavaScript® library that is designed for querying and transforming JSON data. It has a location path syntax for navigating JSON structures similar in nature to the XPath syntax for XML data. One may consider the following example:
-
Input Data: { “Account”: { “Account Name”: “Firefly”, “Order”: [ { “OrderID”: “order103”, “Product”: [ { “ProductName”: “Bowler Hat”, “SKU”: “0406654608”, “Price”: 34.45, “Quantity”: 2 }, { “ProductName”: “Trilby hat”, “SKU”: “0406634348”, “Price”: 21.67, “Quantity”: 1 } ] }, { “OrderID”: “order104”, “Product”: [ { “ProductName”: “Bowler Hat”, “SKU”: “040657863”, “Price”: 34.45, “Quantity”: 4 }, { “ProductName”: “Cloak”, “SKU”: “0406654603”, “Price”: 107.99, “Quantity”: 1 } ] } ] } } - An exemplary JSONata query expression may then be as follows:
-
Account.Order.Product.{ ‘Name’: ProductName, ‘Order’: !.OrderID } - Here, the dot operator specifies that for each item matched by the left hand side (context), select all items that are matched by the right hand side (functional mapping operation). The ‘!’ symbol represents the request to select the parent object of the context. In this case, the sub-path ‘!.OrderID’ is asking for the OrderID property of the ‘Order’ object, which is the parent (enclosing object) of the Product context object.
- The desired result of evaluating this expression on the exemplary input data above is as follows:
-
[ { “Name”: “Bowler Hat”, “Order”: “order103” }, { “Name”: “Trilby hat”, “Order”: “order103” }, { “Name”: “Bowler Hat”, “Order”: “order104” }, { “Name”: “Cloak”, “Order”: “order104” } ] - To achieve this without changing the input data to contain parent references, the AST of the parsed query expression is traversed to identify the AST node that represents the part of the query that matches the parent object.
- According to the proposed concept(s), the augmented AST for the JSONata query expression above is as follows:
-
type: path steps: - value: Account type: name - value: Order type: name - value: Product <− AST node decorated with an ‘ancestor’ attribute. type: name ancestor: 0 tuple: true - type: unary value: ″{″ seekingParent: 0 <− temporary attribute used while traversing up the AST lhs: - - value: Name type: string - type: path steps: - value: ProductName type: name - - value: Order type: string - type: path steps: - type: parent <− AST node representing the ‘!’ token slot: 0 - value: OrderID type: name seekingParent: 0 <− temporary attribute used while traversing up the AST - The query evaluation engine, when processing this augmented AST against the input data will identify the AST node decorated with the ‘ancestor’ attribute and store its input context item (i.e., the current ‘Order’ value) in the tuple stream that contains the accumulated query results plus any temporary variable bindings. This stored value is then available later when the AST node representing the ‘!’ token is processed, and looked up using the unique ‘slot’ number.
- The algorithm used to find the parent AST node is as follows:
- (i)—The parent operator is a type ‘parent’ step in the path array
- (ii) If it is the first step, then label the path as ‘seekingParent’=<number> and step up the AST labelling nodes as ‘seekingParent’ until you are in a path. Repeat this.
- (iii)—If its step index is >=1 (i.e., not the first step), then look at the previous step
- (iv)—Is previous step of type ‘name’ or ‘wildcard’ ?
- (v)—yes: label this step parent=<number>; break (done)
- (vi)—is previous step if type ‘block’ ?
- (vii)—yes: look at last expression in block—repeat from beginning
- (viii)—otherwise throw error—can't determine parent
- From the above description, it will be appreciated that the embodiment of
FIG. 3 may be leveraged for the purpose of processing hierarchical data with a query. By way of example, a proposed embodiment of a processing hierarchical data with a query according to a query language will now be described with reference toFIG. 4 . - Referring to
FIG. 4 , there is shown a flow diagram of a computer-implementedmethod 400 for processing hierarchical data with a query according to a query language. Themethod 400 comprises firstly executing themethod 300 of identifying ancestor objects in hierarchical data according to the embodiment ofFIG. 3 . Then, in step 410, the query is evaluated by processing the augmented AST against the hierarchical data. - Embodiments may comprise a
computer system 70, which may form part of anetworked system 7 illustrated inFIG. 5 . For instance, an augmentation component according to an embodiment may be implemented in the computer system 70 (e.g., as a processing unit 71). The components of computer system/server 70 may include, but are not limited to, one or more processing arrangements, for example comprising processors orprocessing units 71, asystem memory 74, and abus 90 that couples various system components includingsystem memory 74 toprocessing unit 71. -
System memory 74 can include computer system readable media in the form of volatile memory, such as random access memory (RAM) 75 and/orcache memory 76. Computer system/server 70 may further include other removable/non-removable, volatile/non-volatile computer system storage media. In such instances, each can be connected tobus 90 by one or more data media interfaces. Thememory 74 may include at least one program product having a set (e.g., at least one) of program modules that are configured to carry out the functions of proposed embodiments. For instance, thememory 74 may include a computer program product having program executable by theprocessing unit 71 to cause the Input/Output (I/O)interface 72 perform a method for a middleware system of a pub/sub messaging system according to a proposed embodiment. Program/utility 78, having a set (at least one) ofprogram modules 79, may be stored inmemory 74.Program modules 79 generally carry out the functions and/or methodologies of proposed embodiments for pub/sub messaging systems. - Computer system/
server 70 may also communicate with one or moreexternal devices 80 such as a keyboard, a pointing device, adisplay 85, etc.; one or more devices that enable a user to interact with computer system/server 70; and/or any devices (e.g., network card, modem, etc.) that enable computer system/server 70 to communicate with one or more other computing devices. Such communication can occur via Input/Output (I/O) interfaces 72. Still yet, computer system/server 70 can communicate with one or more networks such as a local area network (LAN), a general wide area network (WAN), and/or a public network (e.g., the Internet) via network adapter 73 (e.g., to communicate determined optimal values of DFWF to edge devices of a distributed network). - In the context of the present application, where embodiments of the present invention constitute a method, it should be understood that such a method is a process for execution by a computer, i.e., is a computer-implementable method. The steps of the method therefore reflect various parts of a computer program, e.g., parts of one or more algorithms.
- The present invention may be a system, a method, and/or a computer program product at any possible technical detail level of integration. The computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present invention.
- The computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.
- Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.
- Computer readable program instructions for carrying out operations of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, configuration data for integrated circuitry, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++, or the like, and procedural programming languages, such as the “C” programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.
- Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions.
- These computer readable program instructions may be provided to a processor of a computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.
- The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.
- The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the blocks may occur out of the order noted in the Figures. For example, two blocks shown in succession may, in fact, be accomplished as one step, executed concurrently, substantially concurrently, in a partially or wholly temporally overlapping manner, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions.
- The descriptions of the various embodiments of the present invention have been presented for purposes of illustration, but are not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein was chosen to best explain the principles of the embodiments, the practical application or technical improvement over technologies found in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.
Claims (19)
Priority Applications (11)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US16/745,582 US11960507B2 (en) | 2020-01-17 | 2020-01-17 | Hierarchical data |
US17/128,020 US20210224295A1 (en) | 2020-01-17 | 2020-12-19 | Hierarchical data |
GB2211979.6A GB2607518A (en) | 2020-01-17 | 2021-01-12 | Hierarchical data |
DE112021000573.1T DE112021000573T5 (en) | 2020-01-17 | 2021-01-12 | HIERARCHICAL DATA |
CA3163038A CA3163038A1 (en) | 2020-01-17 | 2021-01-12 | Hierarchical data |
KR1020227018365A KR20220092942A (en) | 2020-01-17 | 2021-01-12 | hierarchical data |
AU2021208982A AU2021208982A1 (en) | 2020-01-17 | 2021-01-12 | Hierarchical data |
PCT/IB2021/050191 WO2021144689A1 (en) | 2020-01-17 | 2021-01-12 | Hierarchical data |
JP2022537263A JP2023510104A (en) | 2020-01-17 | 2021-01-12 | hierarchical data |
CN202180009579.6A CN114981802A (en) | 2020-01-17 | 2021-01-12 | Hierarchical data |
IL294561A IL294561A (en) | 2020-01-17 | 2021-01-12 | Hierarchical data |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US16/745,582 US11960507B2 (en) | 2020-01-17 | 2020-01-17 | Hierarchical data |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US17/128,020 Continuation US20210224295A1 (en) | 2020-01-17 | 2020-12-19 | Hierarchical data |
Publications (2)
Publication Number | Publication Date |
---|---|
US20210224294A1 true US20210224294A1 (en) | 2021-07-22 |
US11960507B2 US11960507B2 (en) | 2024-04-16 |
Family
ID=76857034
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US16/745,582 Active 2040-10-15 US11960507B2 (en) | 2020-01-17 | 2020-01-17 | Hierarchical data |
US17/128,020 Pending US20210224295A1 (en) | 2020-01-17 | 2020-12-19 | Hierarchical data |
Family Applications After (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US17/128,020 Pending US20210224295A1 (en) | 2020-01-17 | 2020-12-19 | Hierarchical data |
Country Status (10)
Country | Link |
---|---|
US (2) | US11960507B2 (en) |
JP (1) | JP2023510104A (en) |
KR (1) | KR20220092942A (en) |
CN (1) | CN114981802A (en) |
AU (1) | AU2021208982A1 (en) |
CA (1) | CA3163038A1 (en) |
DE (1) | DE112021000573T5 (en) |
GB (1) | GB2607518A (en) |
IL (1) | IL294561A (en) |
WO (1) | WO2021144689A1 (en) |
Citations (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20070244865A1 (en) * | 2006-04-17 | 2007-10-18 | International Business Machines Corporation | Method and system for data retrieval using a product information search engine |
US20090112905A1 (en) * | 2007-10-24 | 2009-04-30 | Microsoft Corporation | Self-Compacting Pattern Indexer: Storing, Indexing and Accessing Information in a Graph-Like Data Structure |
US20150046492A1 (en) * | 2013-08-09 | 2015-02-12 | Vmware, Inc. | Query-by-example in large-scale code repositories |
US20160124723A1 (en) * | 2014-10-31 | 2016-05-05 | Weixi Ma | Graphically building abstract syntax trees |
US20170257385A1 (en) * | 2016-03-02 | 2017-09-07 | Shape Security, Inc. | Variable runtime transpilation |
US20180232404A1 (en) * | 2017-02-15 | 2018-08-16 | Ca, Inc. | Self-recomposing program to transform data between schemas |
US20190278572A1 (en) * | 2018-03-08 | 2019-09-12 | Fujitsu Limited | Representing software with an abstract code graph |
US10416972B1 (en) * | 2018-03-16 | 2019-09-17 | Capital One Services, Llc | Generating closures from abstract representation of source code |
US20190294610A1 (en) * | 2016-10-11 | 2019-09-26 | Sage South Africa (Pty) Ltd | System and method for retrieving data from server computers |
US20200301917A1 (en) * | 2018-05-02 | 2020-09-24 | Zte Corporation | Data protection method and device and storage medium |
Family Cites Families (21)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB0619147D0 (en) | 2006-09-28 | 2006-11-08 | Ibm | A method, apparatus or software for managing software component version identifications in a componentised software system |
US8260784B2 (en) | 2009-02-13 | 2012-09-04 | International Business Machines Corporation | Indexing and searching JSON objects |
CN101667190B (en) | 2009-09-29 | 2011-07-27 | 天津大学 | XQuery-based query engine system |
US10089367B2 (en) * | 2013-01-04 | 2018-10-02 | PlaceIQ, Inc. | Expediting pattern matching queries against time series data |
US9230040B2 (en) | 2013-03-14 | 2016-01-05 | Microsoft Technology Licensing, Llc | Scalable, schemaless document query model |
US9405915B2 (en) | 2013-03-14 | 2016-08-02 | Whitehat Security, Inc. | Techniques for correlating vulnerabilities across an evolving codebase |
US9659045B2 (en) | 2013-11-08 | 2017-05-23 | Oracle International Corporation | Generic indexing for efficiently supporting ad-hoc query over hierarchically marked-up data |
US10275305B2 (en) * | 2014-11-25 | 2019-04-30 | Datavore Labs, Inc. | Expert system and data analysis tool utilizing data as a concept |
US10467243B2 (en) | 2015-08-26 | 2019-11-05 | Oracle International Corporation | Efficient in-memory DB query processing over any semi-structured data formats |
US10803083B2 (en) | 2015-08-27 | 2020-10-13 | Infosys Limited | System and method of generating platform-agnostic abstract syntax tree |
US10440447B2 (en) | 2015-10-07 | 2019-10-08 | Lg Electronics Inc. | Broadcast signal transmission/reception device and method |
KR20240025698A (en) | 2015-11-25 | 2024-02-27 | 소니그룹주식회사 | Reception device, transmission device and data processing method |
US10162603B2 (en) * | 2016-09-10 | 2018-12-25 | Sap Se | Loading data for iterative evaluation through SIMD registers |
US20180365201A1 (en) * | 2017-06-14 | 2018-12-20 | Clause, Inc. | System and method for compound data-driven contracts and documentation |
US11475004B2 (en) | 2017-09-12 | 2022-10-18 | Sap Se | Optimizing database queries |
US10922430B2 (en) | 2018-07-16 | 2021-02-16 | Beijing Didi Infinity Technology And Development Co., Ltd. | System and method for data security grading |
US11061716B2 (en) * | 2018-08-20 | 2021-07-13 | Salesforce.Com, Inc. | Attribute-based access control using a dynamic expression engine |
US11256696B2 (en) * | 2018-10-15 | 2022-02-22 | Ocient Holdings LLC | Data set compression within a database system |
US11356440B2 (en) * | 2018-11-30 | 2022-06-07 | International Business Machines Corporation | Automated IoT device registration |
US10846083B2 (en) * | 2018-12-12 | 2020-11-24 | Sap Se | Semantic-aware and self-corrective re-architecting system |
US11294645B2 (en) * | 2019-04-02 | 2022-04-05 | Gavriel Loria | Visual virtual programming machine for real-time interactive creation, playback, execution, inspection and manipulation of programming elements |
-
2020
- 2020-01-17 US US16/745,582 patent/US11960507B2/en active Active
- 2020-12-19 US US17/128,020 patent/US20210224295A1/en active Pending
-
2021
- 2021-01-12 WO PCT/IB2021/050191 patent/WO2021144689A1/en active Application Filing
- 2021-01-12 DE DE112021000573.1T patent/DE112021000573T5/en active Pending
- 2021-01-12 GB GB2211979.6A patent/GB2607518A/en not_active Withdrawn
- 2021-01-12 KR KR1020227018365A patent/KR20220092942A/en active Search and Examination
- 2021-01-12 AU AU2021208982A patent/AU2021208982A1/en not_active Abandoned
- 2021-01-12 CN CN202180009579.6A patent/CN114981802A/en active Pending
- 2021-01-12 JP JP2022537263A patent/JP2023510104A/en active Pending
- 2021-01-12 IL IL294561A patent/IL294561A/en unknown
- 2021-01-12 CA CA3163038A patent/CA3163038A1/en active Pending
Patent Citations (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20070244865A1 (en) * | 2006-04-17 | 2007-10-18 | International Business Machines Corporation | Method and system for data retrieval using a product information search engine |
US20090112905A1 (en) * | 2007-10-24 | 2009-04-30 | Microsoft Corporation | Self-Compacting Pattern Indexer: Storing, Indexing and Accessing Information in a Graph-Like Data Structure |
US20150046492A1 (en) * | 2013-08-09 | 2015-02-12 | Vmware, Inc. | Query-by-example in large-scale code repositories |
US20160124723A1 (en) * | 2014-10-31 | 2016-05-05 | Weixi Ma | Graphically building abstract syntax trees |
US20170257385A1 (en) * | 2016-03-02 | 2017-09-07 | Shape Security, Inc. | Variable runtime transpilation |
US20190294610A1 (en) * | 2016-10-11 | 2019-09-26 | Sage South Africa (Pty) Ltd | System and method for retrieving data from server computers |
US20180232404A1 (en) * | 2017-02-15 | 2018-08-16 | Ca, Inc. | Self-recomposing program to transform data between schemas |
US20190278572A1 (en) * | 2018-03-08 | 2019-09-12 | Fujitsu Limited | Representing software with an abstract code graph |
US10416972B1 (en) * | 2018-03-16 | 2019-09-17 | Capital One Services, Llc | Generating closures from abstract representation of source code |
US20200301917A1 (en) * | 2018-05-02 | 2020-09-24 | Zte Corporation | Data protection method and device and storage medium |
Also Published As
Publication number | Publication date |
---|---|
CA3163038A1 (en) | 2021-07-22 |
US11960507B2 (en) | 2024-04-16 |
WO2021144689A1 (en) | 2021-07-22 |
GB202211979D0 (en) | 2022-09-28 |
GB2607518A (en) | 2022-12-07 |
CN114981802A (en) | 2022-08-30 |
JP2023510104A (en) | 2023-03-13 |
DE112021000573T5 (en) | 2022-12-15 |
IL294561A (en) | 2022-09-01 |
AU2021208982A1 (en) | 2022-06-09 |
KR20220092942A (en) | 2022-07-04 |
US20210224295A1 (en) | 2021-07-22 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US10630614B2 (en) | Opaque message parsing | |
US7991766B2 (en) | Support for user defined aggregations in a data stream management system | |
US8521867B2 (en) | Support for incrementally processing user defined aggregations in a data stream management system | |
US10324909B2 (en) | Omega names: name generation and derivation utilizing nested three or more attributes | |
US10122380B2 (en) | Compression of javascript object notation data using structure information | |
US7673065B2 (en) | Support for sharing computation between aggregations in a data stream management system | |
US20130086100A1 (en) | Method and System Providing Document Semantic Validation and Reporting of Schema Violations | |
US20060242115A1 (en) | System and method for an improved type inference | |
US10489493B2 (en) | Metadata reuse for validation against decentralized schemas | |
US9483508B1 (en) | Omega names: name generation and derivation | |
US20130055065A1 (en) | Validation based on decentralized schemas | |
US9753723B2 (en) | Systems and methods for generating, linking, and presenting computer code representations from diverse sources | |
US11157467B2 (en) | Reducing response time for queries directed to domain-specific knowledge graph using property graph schema optimization | |
US20130325907A1 (en) | Xml file conversion to flat file | |
WO2005111824A2 (en) | Method and system for processing of text content | |
US9971849B2 (en) | Method and system for retrieving legal data for user interface form generation by merging syntactic and semantic contraints | |
US11960507B2 (en) | Hierarchical data | |
CN110308907A (en) | Data transfer device, device, storage medium and electronic equipment | |
US8407209B2 (en) | Utilizing path IDs for name and namespace searches | |
CN112988778A (en) | Method and device for processing database query script | |
US10908924B2 (en) | System and methods for loading objects from hash chains | |
Sakai et al. | Division charts as granules and their merging algorithm for rule generation in nondeterministic data | |
US8443004B2 (en) | System and method for storing and computing business data and logic |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW YORK Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:COLEMAN, ANDREW JOHN;REEVE, JOHN ANTHONY;DOLBY, TREVOR CLIFFORD;REEL/FRAME:051543/0916 Effective date: 20200117 |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: FINAL REJECTION MAILED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: RESPONSE AFTER FINAL ACTION FORWARDED TO EXAMINER |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: ADVISORY ACTION MAILED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: DOCKETED NEW CASE - READY FOR EXAMINATION |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: NON FINAL ACTION MAILED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: FINAL REJECTION MAILED |
|
STCV | Information on status: appeal procedure |
Free format text: NOTICE OF APPEAL FILED |
|
STCV | Information on status: appeal procedure |
Free format text: APPEAL BRIEF (OR SUPPLEMENTAL BRIEF) ENTERED AND FORWARDED TO EXAMINER |
|
STCV | Information on status: appeal procedure |
Free format text: ON APPEAL -- AWAITING DECISION BY THE BOARD OF APPEALS |
|
STCV | Information on status: appeal procedure |
Free format text: BOARD OF APPEALS DECISION RENDERED |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: NOTICE OF ALLOWANCE MAILED -- APPLICATION RECEIVED IN OFFICE OF PUBLICATIONS |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: AWAITING TC RESP., ISSUE FEE NOT PAID |
|
STPP | Information on status: patent application and granting procedure in general |
Free format text: PUBLICATIONS -- ISSUE FEE PAYMENT VERIFIED |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |