Node level hash join for evaluating a query

Details Node level hash join for evaluating a query Node level hash join for evaluating a query

2011-04-12

2011-04-12

Boccio, Vincent (Department: 2158)

Data processing: database and file management or data structures

Database and file access

Preparing data for information retrieval

C707S714000, C707S715000, C707S716000

Reexamination Certificate

active

07925656

ABSTRACT:
Markup language node level hash join operations for evaluating a query language query are performed. The markup language node level hash join mechanism, i.e. the “XHashJoin” operator, is a multi-way join operator that uses two hash tables, BUILD and PROBE, to intersect document nodes from multiple index scans and to buffer intermediate query results. The BUILD hash table stores document nodes matching the predicates of a query, and buffers document nodes satisfying extraction nodes, of each portion of the query up to a current portion of the query being evaluated. The BUILD hash table and the PROBE hash table are switched at each portion of the query being evaluated. Query results are generated by linking document nodes buffered in the BUILD hash table based on the semantics of each extraction node.

REFERENCES:
patent: 7085769 (2006-08-01), Luo et al.
patent: 7165063 (2007-01-01), Beyer et al.
patent: 2004/0010752 (2004-01-01), Chan et al.
patent: 2005/0021503 (2005-01-01), Chiang
patent: 2005/0222965 (2005-10-01), Chaudhuri et al.
patent: 2006/0117036 (2006-06-01), Cruanes et al.
patent: 2006/0218176 (2006-09-01), Sun Hsu et al.
patent: 2006/0235839 (2006-10-01), Krishnaprasad et al.
patent: 2006/0288030 (2006-12-01), Lawrence
patent: 2007/0043696 (2007-02-01), Haas et al.
patent: 2007/0174242 (2007-07-01), Josifovski et al.
patent: 2007/0198479 (2007-08-01), Cai et al.
patent: 2007/0233439 (2007-10-01), Carroll et al.
patent: 2007/0250471 (2007-10-01), Fontoura et al.
Koudas et al., “Data Stream Query Processing”, AT&T Labs-Research, Sep. 17, 2003, pp. 1-121.
Schneider et al., Tradeoffs in Processing Multi-Way Join Queries via Hashing in Multiprocessor Database Machines, Computer Sciences Department, University of Wisconsin, 31 pages.
Tok et al., “Twig'n Join: Progressive Query Processing of Multiple XML Streams”, School of Computing, National University of Singapore, Sep. 2007, pp. 1-19.

Affiliated with

Also associated with

Rating

Node level hash join for evaluating a query does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Node level hash join for evaluating a query, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Node level hash join for evaluating a query will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2718741