Systems and methods for parallel evaluation of multiple queries

Details Systems and methods for parallel evaluation of multiple queries Systems and methods for parallel evaluation of multiple queries

2004-02-20

2010-02-16

Jalil, Neveen Abel (Department: 2165)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C707S793000

Reexamination Certificate

active

07664728

ABSTRACT:
Implementations described herein relate to evaluating multiple queries represented in an opcode tree having opcode nodes and branch nodes. Each opcode node comprises an opcode that is a part of an opcode block derived from compilation of a query, the opcode block consisting of a linear sequence of opcodes. Opcode nodes are arranged in the tree according to location of its corresponding opcode in the opcode block with opcodes that occur earlier in the opcode block being represented at a higher tree level than subsequent opcodes. Only one opcode node corresponds to a common opcode block segment that is included in multiple queries. Executing the opcode tree against an input evaluates each of the multiple queries represented in the opcode tree.

REFERENCES:
patent: 5574900 (1996-11-01), Huang et al.
patent: 5668987 (1997-09-01), Schneider
patent: 6009265 (1999-12-01), Huang et al.
patent: 6253195 (2001-06-01), Hudis et al.
patent: 6405191 (2002-06-01), Bhatt et al.
patent: 6529897 (2003-03-01), Corl, Jr. et al.
patent: 6539394 (2003-03-01), Calvignac et al.
patent: 6654734 (2003-11-01), Mani et al.
patent: 6735595 (2004-05-01), Gobeille et al.
patent: 6738868 (2004-05-01), Gharachorloo et al.
patent: 6757686 (2004-06-01), Syeda-Mahmood et al.
patent: 7136899 (2006-11-01), Campailla
patent: 7277885 (2007-10-01), Eppley et al.
patent: 2004/0027313 (2004-02-01), Pate et al.
patent: 2004/0243588 (2004-12-01), Tanner et al.
patent: 2005/0038688 (2005-02-01), Collins et al.
patent: 2005/0182756 (2005-08-01), Eppley et al.
Altinel, Mehmet, et al., Efficient Filtering of XML Documents for Selective dissemination of Information, 2000, Proceedings of the 26th VLDB Conference, pp. 53-64.
Altinel, Mehmet et al., “Efficient Filtering of XML Documents for Selective Dissemination of Information”, 26th VLBD Conference, 2000, pp. 53-64.
Sailaja, P., “On Efficient Matching of Streaming XML Documents and Queries”, 2002, University of British Columbia, Canada, pp. 1-18.
Sailaja, P., “On Efficient Matching of Streaming XML Documents and Queries”, 2002, University of British Columbia, Canada, pp. 1-20.
Tak W. Yan et al., “Index Structures for Selective Dissemination of Information Under the Boolean Model,” Jun. 1994, ACM Transactions on Database Systems, vol. 19, No. 2, pp. 332-364.
Andersen, Henrik Reif, “An Introduction to Binary Decision Diagrams,” Lecture nodes for 49285 Advanced Algorithms E97, Department of Information Technology, Technical University of Denmark, Oct. 1997, pp. 1-37.
Bryant, Randal E., “Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams,” CMU-CS-92-160, ACM Computing Surveys, School of Computer Science, Carnegie Mellon University, Pittsburg, PA, Jul. 1992, pp. 1-33.
Socher, Rolf, “Optimizing the Clausal Normal Form Transformation,” Journal of Automated Reasoning, vol. 7, 1991, pp. 325-336.
Aguilera, et al., “Matching Events in a Content-based Subscription System”, ACM, 1999, pp. 18.
Andersen, “An Introduction to Binary Decision Diagrams,” Lecture Nodes for 49285 Advanced Algorithms E97, Department of Information Technology, Technical University of Denmark, Oct. 1997, pp. 1-37.
Bryant, “Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams,” CMU-CS-92-160, ACM Computing Surveys, School of Computer Science, Carnegie Mellon University, Pittsburg, PA, Jul. 1992, pp. 1-33.
Cole, et al., “Optimization of Dynamic Query Evaluation Plans”, ACM, 1994, pp. 150-160.
Graefe, et al., “Dynamic Query Evaluation Plans”, ACM, 1989, pp. 358-366.
“IEEE Standards”, at <<http://www.ieee.org/web/standards/home/index.html>>, IEEE, 2007, pp. 2.
“Interface Node”, at <<http://java.sun.com/j2se/1.4.2/docs/api/org/w3c/dom/Node.html>>, Java 2 Platform Std. Ed., v1.4.2, 2007, pp. 14.
Socher, “Optimizing the Clausal Normal Form Transformation,” Journal of Automated Reasoning, vol. 7, 1991, pp. 325-336.
“XML Path Language (XPath) Version 1.0”, at <<http://www.w3.org/TR/xpath>>, W3C, Nov. 16, 1999, pp. 37.
Yan, et al., “Index Structures for Selective Dissemination of Information Under the Boolean Model”, ACM, vol. 19, No. 2, Jun. 1994, pp. 332-364.

Affiliated with

Also associated with

Rating

Systems and methods for parallel evaluation of multiple queries 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 parallel evaluation of multiple queries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Systems and methods for parallel evaluation of multiple queries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4216279