Select indexing in merged inverse query evaluations

Data processing: database and file management or data structures – Database design – Data structure types

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S793000, C707S793000

Reexamination Certificate

active

07472130

ABSTRACT:
Embodiments provide for select indexing, which uses an array to simultaneously construct output sets for instructions that operate on input nodesets with common axes. During evaluation of a message against an instruction tree, when a branching node with a large “splay” is iterated over, rather than iterating over an input nodeset with a common axis once per branch, the select indexing described herein iterates over the nodeset once in total. More specifically, the select index data structure includes an array of empty node sets for instructions that both, branch from a branching node, and evaluate input nodes that share a common axis. Identifiers for the input nodeset are compared to indices within the select index, and matches for the input nodes are added to the corresponding nodeset for the appropriate instruction. The results of the evaluation may then be passed to the branches of the select instructions for further processing.

REFERENCES:
patent: 2002/0133484 (2002-09-01), Chau et al.
patent: 2003/0033285 (2003-02-01), Jalali et al.
patent: 2004/0010752 (2004-01-01), Chan et al.
patent: 2004/0103091 (2004-05-01), Lindblad et al.
patent: 2005/0055334 (2005-03-01), Krishnamurthy
patent: 2005/0097084 (2005-05-01), Balmin et al.
patent: 2005/0187906 (2005-08-01), Madan et al.
patent: 2005/0187947 (2005-08-01), Wortendyke et al.
patent: 2005/0228768 (2005-10-01), Thusoo et al.
patent: 2005/0228792 (2005-10-01), Chandrasekaran et al.
patent: 2006/0005122 (2006-01-01), Lemoine
patent: 2004/068270 (2004-12-01), None
Yan et al, Index Structures for Selective Dissemination of Information Under the Boolean Model, 1994, ACM Transactions on Database Systems, citeseer.ist.psu.edu/article/yan94index.html.
Altinel et al, Efficient Filtering of XML Documents for Selective Dissemination of Information, 2000, Proc. VLDB Conference,http://citeseer.ist.psu.edu/altinel00efficient.html.
W3C, SOAP Version 1.2 Part 1: Messaging Framework, W3C Recommendation Jun. 24, 2003, http://www.w3.org/TR/2003/REC-soap12-part1-20030624/.
Grama et al, A Survey of Parallel Search Algorithms for Discrete Optimization Problems, 1995, ORSA Journal of Computing, 7(4):365-385, http://citeseer.ist.psu.edu/et93survey.html.
Krishnaprasad, et al.,Query Rewrite for XML in Oracle XML DB, 2004 Oracle Corporation, 30th VLDB Conference,available athttp://www.vldb.org/conf/2004/IND5P1.PDF, (PDF enclosed entitled “Article 1,” 12 pages).
Liu, et al., “An Evaluation of the Configurable Indexing and Ranking System for Retrieving Information from XML Documents,” UCLA Computer Science Department,available athttp://www.cs.ucla.edu/˜sliu/papers/TR040038.pdf (PDF enclosed entitled “Article 2,” 19 pages).
Mahboob Alam Khalid, “Implementation and Evaluation of a Path Indexing Framework for Large Collections of Interlinked XML Documents,” Saarland University,available athttps://domino.mpi-sb.mpg.de/intranet/ag5/ag5publ.nsf/0/3634c105cc851603c1256ede003817e3/$FILE/khalid.pdf (PDF enclosed entitled “Article 3,” 122 pages).

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Select indexing in merged inverse query evaluations does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Select indexing in merged inverse query evaluations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Select indexing in merged inverse query evaluations will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4051114

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.