Compositional query comprehensions

Details Compositional query comprehensions Compositional query comprehensions

2011-01-04

2011-01-04

Vo, Tim T. (Department: 2168)

Data processing: database and file management or data structures

Database design

Database and data structure management

C707S805000, C707S807000, C707S899000, C071S064120, C071S064120, C071S064120, C071S064120

Reexamination Certificate

active

07865533

ABSTRACT:
The claimed subject matter relates to an architecture that can facilitate query comprehension that are constructed in a compositional manner. In accordance therewith, the query comprehensions can be assembled together in virtually in order without common requirements that force query operators of a query expression to follow ordering/syntactic rules. In addition, the architecture can provide for query expressions that arbitrarily composable and which can be terminated at any point. If the query expression terminates without a Select or Return clause at the end, the architecture can facilitate generation of an implicit Select or Return, and output results.

REFERENCES:
patent: 5197005 (1993-03-01), Shwartz et al.
patent: 5237502 (1993-08-01), White et al.
patent: 5282265 (1994-01-01), Rohra Suda et al.
patent: 5418943 (1995-05-01), Borgida et al.
patent: 5418948 (1995-05-01), Turtle
patent: 5428737 (1995-06-01), Li et al.
patent: 6272488 (2001-08-01), Chang et al.
patent: 6341277 (2002-01-01), Coden et al.
patent: 6480836 (2002-11-01), Colby et al.
patent: 6775681 (2004-08-01), Ballamkonda et al.
patent: 6965990 (2005-11-01), Barsness et al.
patent: 7086041 (2006-08-01), Plesko
patent: 7110991 (2006-09-01), Arnold
patent: 7120898 (2006-10-01), Grover
patent: 7440963 (2008-10-01), Bello et al.
patent: 2001/0013030 (2001-08-01), Colby et al.
patent: 2002/0026443 (2002-02-01), Chang et al.
patent: 2004/0172587 (2004-09-01), Lawlor
patent: 2004/0193575 (2004-09-01), Chen
patent: 2004/0267690 (2004-12-01), Bhogal et al.
patent: 2005/0203869 (2005-09-01), Minamino
patent: 2005/0216500 (2005-09-01), Edelstein et al.
patent: 2006/0161521 (2006-07-01), Dettinger et al.
patent: 2006/0173804 (2006-08-01), Desai
patent: 2006/0224627 (2006-10-01), Manikutty et al.
patent: 2006/0230063 (2006-10-01), Pollinger
patent: 2006/0235834 (2006-10-01), Blakeley et al.
patent: 2006/0235835 (2006-10-01), Dettinger et al.
patent: 2006/0294081 (2006-12-01), Dettinger et al.
patent: 0477152 (1992-03-01), None
Raman, et al. “Partial Results for Online Query Processing” (2002) ACM, 12 pages.
Frasincar, et a;. “XAL: An Algebra for XML Query Optimization” (2001) Proceedings of the 13th Australian Database Society, 8 pages.
Meijer, et al. “XLinq: XML Programming Refactored (The Return of the Monoids)” http://research.microsoft.com/˜emeijer/Papers/XMLRefactored.html last viewed Nov. 17, 2006, 16 pages.
International Search Report and Written Opinion for PCT Patent Application No. PCT/US2008/053095, Jul. 3, 2008, 12 pages.
Meijer, et al., “LINQ: Recording objects, Relations and XML in the .NET Framework” (2006) ACM, 1 Page.
“The LINQ Project .NET Language Integrated Query” (2005) Microsoft Paper, 28 Pages.
“XLing .NET Language Integrated Query for XML Data” (2005) Microsoft Paper, 41 Pages.
Office Action dated May 14, 2009 cited in U.S. Appl. No. 11/671,414.
U.S. Appl. No. 11/671,414, Jul. 20, 2010, Notice of Allowance.

Affiliated with

Also associated with

Rating

Compositional query comprehensions does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Compositional query comprehensions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compositional query comprehensions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2620970