Data processing: database and file management or data structures – Database and file access – Search engines
Reexamination Certificate
2011-01-14
2011-10-04
Ali, Mohammad (Department: 2158)
Data processing: database and file management or data structures
Database and file access
Search engines
C707S713000
Reexamination Certificate
active
08032509
ABSTRACT:
Systems and methods for storing and accessing data. A query language statement may reference a plurality of data sets and a plurality of algebraic relations between the data sets may be composed from the query language statement. The algebraic relations may be used to define new data sets and to optimize access to data sets. A store of algebraic relations may be accumulated over time. Alternative collections of algebraic relations may be generated and evaluated to determine an optimized collection of algebraic relations to use in calculating and providing a requested data set. The optimization may be performed using the algebraic relations rather than retrieving underlying data sets from storage. As a result, optimization may be performed at processor speeds to minimize the amount of time required for data to be retrieved from slower storage.
REFERENCES:
patent: 4290115 (1981-09-01), Pitt et al.
patent: 4925311 (1990-05-01), Neches et al.
patent: 4945471 (1990-07-01), Neches
patent: 4956772 (1990-09-01), Neches
patent: 5006978 (1991-04-01), Neches
patent: 5303244 (1994-04-01), Watson
patent: 5321813 (1994-06-01), McMillen et al.
patent: 5511190 (1996-04-01), Sharma et al.
patent: 5588129 (1996-12-01), Ballard
patent: 5625815 (1997-04-01), Maier et al.
patent: 5717911 (1998-02-01), Madrid et al.
patent: 5740433 (1998-04-01), Carr et al.
patent: 5740434 (1998-04-01), Eastep
patent: 5745753 (1998-04-01), Mosher, Jr.
patent: 5778354 (1998-07-01), Leslie et al.
patent: 5794252 (1998-08-01), Bailey et al.
patent: 5799322 (1998-08-01), Mosher, Jr.
patent: 5819255 (1998-10-01), Celis et al.
patent: 5822747 (1998-10-01), Graefe et al.
patent: 5835915 (1998-11-01), Carr et al.
patent: 5884328 (1999-03-01), Mosher, Jr.
patent: 5987453 (1999-11-01), Krishna et al.
patent: 6021405 (2000-02-01), Celis et al.
patent: 6032144 (2000-02-01), Srivastava et al.
patent: 6061676 (2000-05-01), Srivastava et al.
patent: 6076152 (2000-06-01), Huppenthal et al.
patent: 6105033 (2000-08-01), Levine
patent: 6161103 (2000-12-01), Rauer et al.
patent: 6327587 (2001-12-01), Forster
patent: 6449605 (2002-09-01), Witkowski
patent: 6460027 (2002-10-01), Cochrane et al.
patent: 6484247 (2002-11-01), Gendron et al.
patent: 6516310 (2003-02-01), Paulley
patent: 6529903 (2003-03-01), Smith et al.
patent: 6601058 (2003-07-01), Forster et al.
patent: 6615209 (2003-09-01), Gomes et al.
patent: 6621612 (2003-09-01), Chan et al.
patent: 6658423 (2003-12-01), Pugh et al.
patent: 6678681 (2004-01-01), Brin
patent: 6865575 (2005-03-01), Smith et al.
patent: 7240078 (2007-07-01), Cheng et al.
patent: 7254810 (2007-08-01), Barsness et al.
patent: 7464867 (2008-12-01), Kolls
patent: 7613734 (2009-11-01), Piedmonte
patent: 7720806 (2010-05-01), Piedmonte
patent: 7725444 (2010-05-01), Devarakonda et al.
patent: 7730042 (2010-06-01), Devarakonda et al.
patent: 7769754 (2010-08-01), Piedmonte
patent: 7797319 (2010-09-01), Piedmonte
patent: 7865503 (2011-01-01), Piedmonte
patent: 7877370 (2011-01-01), Piedmonte
patent: 2002/0087361 (2002-07-01), Benigno et al.
patent: 2003/0105925 (2003-06-01), Yoshimura et al.
patent: 2004/0054648 (2004-03-01), Mogi et al.
patent: 2007/0022093 (2007-01-01), Wyatt et al.
patent: 2007/0266000 (2007-11-01), Piedmonte
patent: 2007/0276784 (2007-11-01), Piedmonte
patent: 2007/0276785 (2007-11-01), Piedmonte
patent: 2007/0276786 (2007-11-01), Piedmonte
patent: 2007/0276787 (2007-11-01), Piedmonte
patent: 2007/0276802 (2007-11-01), Piedmonte
patent: 2010/0082541 (2010-04-01), Kottomtharayil
patent: 2010/0125553 (2010-05-01), Huang et al.
patent: WO 2007/134278 (2007-11-01), None
patent: WO 2007/134278 (2007-11-01), None
Angus, J., “Fast, Scalable Data Mart Maker,” Informationweek, Feb. 8, 1999.
Champion, M., “The Feasibility of an Operation-Centric Environment for Processing XML Documents,” Jan. 26, 2001, pp. 1-4 (printed Feb. 20, 2008 from http://xsp.xegesis.org/).
Champion, M., “The Feasibility of an Operation-Centric Environment for Processing XML Documents,” Jan. 26, 2001.
Champion, M., “XSP: An Integration Technology for Systems Development and Evolution Formal Specifications for Unifying XML and Relational Systems,” Jul. 12, 2001, pp. 1-19 (printed Feb. 20, 2008 from http://xsp.xegesis.org/).
Childs, D. L., “Adaptive Data Restructuring Functions,” Sep. 8, 2002 (printed Feb. 20, 2008 from http://xsp.xegesis.org/).
Childs, D. L., “Axiomatic Extended Set Theory,” Jun. 11, 2002 (printed Feb. 20, 2008 from http://xsp.xegesis.org/).
Childs, D. L., “Data Warehouse or Information Black Hole?” Mar. 6, 2007 (printed Feb. 20, 2008 from http://xsp.xegesis.org/).
Childs, D. L., “Extended Set Theory a General Model for Very Large, Distributed, Backend Information Systems,” 3rdInternational Conference on Very Large Data Bases, Oct. 6-8, 1977, pp. 28-46, Tokyo, Japan.
Childs, D. L., “Feasibility of a Set-Theoretic Data Structure a General Structure Based on a Reconstituted Definition of Relation,” Proceedings of IFIP Congress, Aug. 5-10, 1968, pp. 420-430, vol. 1, Edinburgh, Amsterdam.
Childs, D. L., “Introduction to a Mathematical Foundation for Systems Development,” NATO ASI Series, Database Machines, 1986, pp. 217-255, vol. F24, Springer-Verlag Berlin Heidelberg.
Childs, D. L., “Modeling Data Processing Implementations,” Apr. 3, 2006 (printed Feb. 20, 2008 from http://xsp.xegesis.org/).
Childs, D. L., “Modeling Data Processing Implementations,” Jun. 8, 2002 (printed Feb. 20, 2008 from http://xsp.xegesis.org/).
Childs, D. L., “Pebble Piles & Index Structures,” Aug. 8, 2005 (printed Feb. 20, 2008 from http://xsp.xegesis.org/).
Childs, D. L., “Rapid Response Transaction Processing,” Mar. 3, 2005, pp. 1-2 (printed Feb. 20, 2008 from http://xsp.xegesis.org/).
Childs, D. L., “RDM-Relations & XML-Structures as Xsets,” Jul. 9, 2002, pp. 1-3 (printed Feb. 20, 2008 from http://xsp.xegesis.org/).
Childs, D. L., “What is XSP?” Aug. 8, 2005 (printed Feb. 20, 2008 from http://xsp.xegesis.org/).
Childs, D. L., “XSP Technology for XML Systems Design and Development,” Nov. 29, 2000, pp. 1-30.
Childs, D. L., “XSP Technology: A Foundation for Integrated Information Access Systems,” Jun. 20, 2002 (printed Feb. 20, 2008 from http://xsp.xegesis.org/).
Childs, D. L., “XST Notes: Tuplesets, Tagged-Sets, Application, & Etc.”, Dec. 4, 2005 (printed Feb. 20, 2008 from http://xsp.xegesis.org/).
Codd, E. F., “A Relational Model of Data for Large Shared Data Banks,” Communications of the ACM, Jun. 1970, pp. 377-387, vol. 13, No. 6.
Fillat, A.I. et al, “Generalized Organization of Large Data-Bases; A Set-Theoretic Approach to Relations,” Project MAC, Mass. Institute of Tech., Jun. 1970, 249 pages (thesis for B.S. and M.S., Dept. of Electrical Engineering, Mass. Institute of Tech.).
Haghighat, M. et al., “Symbolic Program Analysis and Optimization for Parallelizing Compilers,” 1999, pp. 1-30.
Information Access Architectures, PowerPoint presentation 2002 (printed Feb. 20, 2008 from http://xsp.xegesis.org/).
Rapid Information Access, Jan. 11, 2003 (printed Feb. 20, 2008 from http://xsp.xegesis.org/).
Skolem, T., “Two Remarks on Set Theory,” Math. Scand., Apr. 15, 1957, pp. 40-46, vol. 5.
Stein, D., “The Trouble with Software,” 2003, pp. 1-10 (printed Feb. 20, 2008 from http://xsp.xegesis.org/).
Stout, R., The Information Access Accelerator, PowerPoint presentation Nov. 4, 2005 (printed Feb. 20, 2008 from http://xsp.xegesis.org/).
X-Set A Closer Look at Digital Archaeology's Patent-Pending Technology, Digital Archaeology, 1998.
X-Set Technology White Paper, Digital Archaeology, Jun. 15, 2000.
Piedmont, C., “Systems and Methods for Data Storage and Retrieval Using Algebraic Relations Composed form Query Language Statements,” U.S. Appl. No. 11/383,476, filed May 15, 2006, Office Action
Algebraix Data Corporation
Ali Mohammad
Hocker John P
Wilson Sonsini Goodrich & Rosati
LandOfFree
Systems and methods for data storage and retrieval using... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Systems and methods for data storage and retrieval using..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Systems and methods for data storage and retrieval using... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4257958