7349897

Structured Indexes on Results of Function Applications Over Data

PublishedMarch 25, 2008
Assigneenot available in USPTO data we have
Technical Abstract

Patent Claims
10 claims

Legal claims defining the scope of protection, as filed with the USPTO.

1

1. A computer-readable storage medium having stored thereon a data structure, wherein the data structure is generated by a method for querying data, comprising: a first data field containing an object; and a second data field containing data associated with the object, the data being derived from a functional invocation over the data, the functional invocation comprising a table valued function, wherein the method for querying data comprises: receiving an indexed view for the functional invocation, determining if the query is satisfied by the index view by determining if the query matches the index view; applying the indexed view as an index to the functional invocation over the data if the query is satisfied by the index view; introducing a back-join to the indexed view; applying the indexed view as an index to the functional invocation over the data if the query cannot be satisfied by the index view; and determining and storing a query result using the index to the functional invocation over the data, wherein determining the query result comprises performing an unnesting operation on nested data, further wherein the unnesting operation is a cross apply unnest operation, and further wherein the indexed view is a generalization of a plurality of partial indexes.

2

2. The computer-readable storage medium of claim 1 , wherein the data is derived from an unnesting operation, and the first data field and the second data field comprise a clustering key.

3

3. The computer-readable storage medium of claim 2 , wherein the clustering key back-joins an indexed view to a base table.

4

4. The computer-readable storage medium of claim 1 , wherein the data comprises XML valued data fields.

5

5. The computer-readable storage medium of claim 1 , wherein the data comprises multiple columns or multiple fields of a complex structure.

6

6. A computer-readable storage medium having stored thereon a data structure, wherein the data structure is generated by a method for querying data, comprising: a first data field containing an object; and a second data field containing data associated with the object, the data being derived from a functional invocation over the data, the functional invocation comprising a table valued function, wherein the method for querying data comprises: receiving an indexed view for the functional invocation, determining if the query is satisfied by the index view by determining if the query matches the index view; applying the indexed view as an index to the functional invocation over the data if the query is satisfied by the index view; introducing a back-join to the indexed view; applying the indexed view as an index to the functional invocation over the data if the query cannot be satisfied by the index view; and determining and storing a query result using the index to the functional invocation over the data, wherein determining the query result comprises performing an unnesting operation on nested data, wherein the unnesting operation is a cross apply unnest operation, and wherein performing the unnesting operation provides an unnested result, and further comprises indexing a view on the unnested result.

7

7. The computer-readable storage medium of claim 6 , wherein the data is derived from an unnesting operation, and the first data field and the second data field comprise a clustering key.

8

8. The computer-readable storage medium of claim 7 , wherein the clustering key back-joins an indexed view to a base table.

9

9. The computer-readable storage medium of claim 6 , wherein the data comprises XML valued data fields.

10

10. The computer-readable storage medium of claim 6 , wherein the data comprises multiple columns or multiple fields of a complex structure.

Patent Metadata

Filing Date

Unknown

Publication Date

March 25, 2008

Inventors

Conor J. Cunningham
Eric N. Hanson
Milind M. Joshi
Cesar A. Galindo-Legaria
Florian M. Waas

Want to explore more patents?

Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.

Citation & reuse

Analysis on this page is generated by Patentable — an AI-powered patent intelligence platform. AI-generated summaries, explanations, and analysis may be reused with attribution and a visible link back to the canonical URL below. Patent abstracts and claims are USPTO public domain.

Cite as: Patentable. “STRUCTURED INDEXES ON RESULTS OF FUNCTION APPLICATIONS OVER DATA” (7349897). https://patentable.app/patents/7349897

© 2026 Patentable. All rights reserved.

Patentable is a research and drafting-assistant tool, not a law firm, and does not provide legal advice. Documents we generate are drafts for review by a licensed patent attorney.

STRUCTURED INDEXES ON RESULTS OF FUNCTION APPLICATIONS OVER DATA — Conor J. Cunningham | Patentable