Scalable, schemaless document query model
AssigneeMicrosoft Technology Licensing, LLC
InventorsDharma Shukla, Madhan Gajendran, Quetzalcoatl Bradley, Shireesh Kumar Thota, Li Zhang, Mihai Dan Budiu, Yuan Yu
Life of this patent
Estimating the term…
Loading patent…
AssigneeMicrosoft Technology Licensing, LLC
InventorsDharma Shukla, Madhan Gajendran, Quetzalcoatl Bradley, Shireesh Kumar Thota, Li Zhang, Mihai Dan Budiu, Yuan Yu
Estimating the term…
Query models for document sets (such as XML documents or records in a relational database) typically involve a schema defining the structure of the documents. However, rigidly defined schemas often raise difficulties with document validation with even inconsequential structural variations. Additionally, queries developed against schema-constrained documents are often sensitive to structural details and variations that are not inconsequential to the query, resulting in inaccurate results and development complications, and that may break upon schema changes. Instead, query models for hierarchically structured documents that enable “twig” queries specifying only the structural details of document nodes that are relevant to the query (e.g., students in a student database having a sibling named “Lee” and a teacher named “Smith,” irrespective of unrelated structural details of the document). Such “twig” query models may enable a more natural query development, and continued accuracy of queries in the event of unrelated schema variations and changes.
A method of applying queries to a document set comprising at least one document, respective documents comprising at least one node comprising a node name and a node path from a root node of the document, the method comprising:
A nonvolatile computer-readable storage device comprising instructions that, when executed on a processor of a device, apply queries to a document set comprising at least one document, respective documents comprising at least one node comprising a node name and a node path from a root node of the document, by:
A system of applying, on a device having a processor and a memory, queries to a document set comprising at least one document, respective documents comprising at least one node comprising a node name and a node path from a root node of the document, the system comprising:
Dependencies are inferred from the claim text.