| Match graphs for query evaluation -> Monitor Keywords |
|
|
 
Match graphs for query evaluationRelated Patent Categories: Data Processing: Database And File Management Or Data Structures, Database Or File Accessing, Query Processing (i.e., Searching)Match graphs for query evaluation description/claimsThe Patent Description & Claims data below is from USPTO Patent Application 20070174241, Match graphs for query evaluation. Brief Patent Description - Full Patent Description - Patent Application Claims
BACKGROUND [0001] 1. Field [0002] Embodiments of the invention relate to match graphs for query evaluation. [0003] 2. Description of the Related Art [0004] Extensible Markup Language (XML) may be described as a flexible text format. XML is a formal recommendation from the World Wide Web Consortium (W3C). XML contains markup symbols to describe the contents of a document. In particular, XML describes the content in terms of what data is being described. Thus, an XML document may be processed as data by a program or may be stored with similar data. XML is "extensible" in that the markup symbols are self-defining. XML is a subset of the Standard Generalized Markup Language (SGML), which is a standard for how to create a document structure. [0005] XML Path Language (XPath) is a language that describes a way to locate and process items in XML documents by using an addressing syntax based on a path through the logical structure or hierarchy of the document. That is, XPath is a language for addressing parts of an XML document. [0006] XML Query (XQuery) provides query facilities to extract data from documents and collections. XQuery is a specification for a query language that allows a user or programmer to extract information from an XML document or any collection of data that is similar in structure to an XML document. [0007] XQuery makes use of XPath. In XQuery, XPath expressions may be simple queries or parts of larger queries. [0008] Notwithstanding existing techniques for processing XML queries, there is a need in the art for improved processing of XML queries. SUMMARY OF EMBODIMENTS OF THE INVENTION [0009] Provided are a method, computer program product, and system for processing a query. The query is received, and the query is formed by one or more paths, where each path includes one or more steps. A hierarchical document is received that includes one or more document nodes. While processing the query and traversing the hierarchical document to find document nodes described by at least one of the one or more steps of the query, a match graph is constructed that includes one or more match nodes. Each of the match nodes identifies a step instance and is associated with step instances that are ancestors and descendants of the identified step instance. Also, each of the match nodes is associated with a level. In addition, the match graph includes zero or more edges between the match nodes indicating relationships between the match nodes. The match nodes in the match graph are traversed from lower levels to higher levels to construct results for the query. BRIEF DESCRIPTION OF THE DRAWINGS [0010] Referring now to the drawings in which like reference numbers represent corresponding parts throughout: [0011] FIG. 1 illustrates details of a computing device in accordance with certain embodiments; [0012] FIG. 2 illustrates a document, a query, and a query structure in accordance with certain embodiments; [0013] FIG. 3 illustrates a hierarchical document and a query with FOR bindings in accordance with certain embodiments; [0014] FIG. 4 illustrates building of a match graph in accordance with certain embodiments; [0015] FIG. 5 illustrates results of processing a query with FOR bindings using a match graph in accordance with certain embodiments; [0016] FIG. 6 illustrates a hierarchical document and a query with LET bindings in accordance with certain embodiments; [0017] FIG. 7 illustrates building of a match graph with LET match nodes in accordance with certain embodiments; [0018] FIG. 8 illustrates results of processing a query with LET bindings using a match graph in accordance with certain embodiments; [0019] FIG. 9 illustrates logic performed by a query processor in accordance with certain embodiments; and [0020] FIG. 10 illustrates a system architecture that may be used in accordance with certain embodiments. DETAILED DESCRIPTION Continue reading about Match graphs for query evaluation... Full patent description for Match graphs for query evaluation Brief Patent Description - Full Patent Description - Patent Application Claims Click on the above for other options relating to this Match graphs for query evaluation patent application. ###  How KEYWORD MONITOR works... a FREE service from FreshPatents1. Sign up (takes 30 seconds). 2. Fill in the keywords to be monitored. 3. Each week you receive an email with patent applications related to your keywords. Start now! - Receive info on patent apps like Match graphs for query evaluation or other areas of interest. ### Previous Patent Application: Indexing and searching numeric ranges Next Patent Application: Method and system for data processing with load balance Industry Class: Data processing: database and file management or data structures ### FreshPatents.com Support Thank you for viewing the Match graphs for query evaluation patent info. IP-related news and info Results in 1.01779 seconds Other interesting Feshpatents.com categories: Qualcomm , Schering-Plough , Schlumberger , Seagate , Siemens , Texas Instruments , 174 |
 * Protect your Inventions * US Patent Office filing 
PATENT INFO |
|
