Parallel Boolean operations for information retrieval

Bataineh, Abdulla; Özgüner, F.; Sarwal, Alok

doi:10.1016/0020-0190(91)90162-b

Search citation statements

Order By: Relevance

Paper Sections

Select...

Computing Boolean Operations On Posting Lists1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1994

2004

Publication Types

Select...

Book1

Article1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another area in which parallel processing is used in conjunction with an inverted index is the computation of Boolean operations on two posting lists, A and B [Bataineh et aI., 1989, Bataineh et al, 1991. The posting lists are partitioned so that the total number of elements in each partition is of equal size.…”

Section: Computing Boolean Operations On Posting Listsmentioning

confidence: 99%

Information Retrieval

Grossman,

Frieder

2004

192

View full text Add to dashboard Cite

Section: Computing Boolean Operations On Posting Listsmentioning

confidence: 99%

Information Retrieval

Grossman,

Frieder

2004

192

View full text Add to dashboard Cite

Site and query scheduling policies in multicomputer database systems

Baru¹

1994

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

We study run-time issues, such as site allocation and query scheduling policies, in executing read-only queries in a hierarchical, distributed memory, multicomputer system. The particular architecture considered here is based on the hypercube interconnection. The data are stored in a base cube, which is controlled by a control cube and host node hierarchy. Input query trees are transformed into operation sequence trees, and the operation sequences become the units of scheduling. These sequences are scheduled dynamically at run-time. Algorithms for dynamic site allocation are provided. Several query scheduling policies that support interquery concurrency are also studied. Average query completion times and initiation delays are obtained for the various policies using simulations.Index Terms-Database systems, multicomputer systems, parallel database systems, query processing, scheduling, relational joins i 0. Frieder (SM'93) received the Ph.D. degree from the University of Michigan in 1987.

show abstract

Parallel Boolean operations for information retrieval

Cited by 2 publications

References 6 publications

Information Retrieval

Information Retrieval

Site and query scheduling policies in multicomputer database systems

Contact Info

Product

Resources

About