Scheduling intersection queries in term partitioned inverted files

Mauricio Marin; Carlos Gomez-Pantoja; Senen Gonzalez; Veronica Gil-Costa

doi:10.1007/978-3-540-85451-7_47

Scheduling intersection queries in term partitioned inverted files

Mauricio Marin, Carlos Gomez-Pantoja, Senen Gonzalez, Veronica Gil-Costa

Engineering School

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

6 Citations (Scopus)

Abstract

This paper proposes and presents a comparison of scheduling algorithms applied to the context of load balancing the query traffic on distributed inverted files. We put emphasis on queries requiring intersection of posting lists, which is a very demanding case for the term partitioned inverted file and a case in which the document partitioned inverted file used by current search engines can perform very efficiently. We show that with proper scheduling of queries the term partitioned approach can outperform the document partitioned approach.

Original language	English
Title of host publication	Euro-Par 2008 Parallel Processing - 14th International Euro-Par Conference, Proceedings
Pages	434-443
Number of pages	10
DOIs	https://doi.org/10.1007/978-3-540-85451-7_47
Publication status	Published - 22 Sept 2008
Event	14th International Euro-Par Conference, Euro-Par 2008 - Las Palmas de Gran Canaria, Spain Duration: 26 Aug 2008 → 29 Aug 2008

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5168 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	14th International Euro-Par Conference, Euro-Par 2008
Country/Territory	Spain
City	Las Palmas de Gran Canaria
Period	26/08/08 → 29/08/08

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-85451-7_47

Cite this

Marin, M., Gomez-Pantoja, C., Gonzalez, S., & Gil-Costa, V. (2008). Scheduling intersection queries in term partitioned inverted files. In Euro-Par 2008 Parallel Processing - 14th International Euro-Par Conference, Proceedings (pp. 434-443). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5168 LNCS). https://doi.org/10.1007/978-3-540-85451-7_47

Marin, Mauricio ; Gomez-Pantoja, Carlos ; Gonzalez, Senen et al. / Scheduling intersection queries in term partitioned inverted files. Euro-Par 2008 Parallel Processing - 14th International Euro-Par Conference, Proceedings. 2008. pp. 434-443 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{3b2f2370401d4128916e49ffa232169b,

title = "Scheduling intersection queries in term partitioned inverted files",

abstract = "This paper proposes and presents a comparison of scheduling algorithms applied to the context of load balancing the query traffic on distributed inverted files. We put emphasis on queries requiring intersection of posting lists, which is a very demanding case for the term partitioned inverted file and a case in which the document partitioned inverted file used by current search engines can perform very efficiently. We show that with proper scheduling of queries the term partitioned approach can outperform the document partitioned approach.",

author = "Mauricio Marin and Carlos Gomez-Pantoja and Senen Gonzalez and Veronica Gil-Costa",

year = "2008",

month = sep,

day = "22",

doi = "10.1007/978-3-540-85451-7_47",

language = "English",

isbn = "3540854509",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "434--443",

booktitle = "Euro-Par 2008 Parallel Processing - 14th International Euro-Par Conference, Proceedings",

note = "14th International Euro-Par Conference, Euro-Par 2008 ; Conference date: 26-08-2008 Through 29-08-2008",

}

Marin, M, Gomez-Pantoja, C, Gonzalez, S & Gil-Costa, V 2008, Scheduling intersection queries in term partitioned inverted files. in Euro-Par 2008 Parallel Processing - 14th International Euro-Par Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5168 LNCS, pp. 434-443, 14th International Euro-Par Conference, Euro-Par 2008, Las Palmas de Gran Canaria, Spain, 26/08/08. https://doi.org/10.1007/978-3-540-85451-7_47

Scheduling intersection queries in term partitioned inverted files. / Marin, Mauricio; Gomez-Pantoja, Carlos; Gonzalez, Senen et al.
Euro-Par 2008 Parallel Processing - 14th International Euro-Par Conference, Proceedings. 2008. p. 434-443 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5168 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Scheduling intersection queries in term partitioned inverted files

AU - Marin, Mauricio

AU - Gomez-Pantoja, Carlos

AU - Gonzalez, Senen

AU - Gil-Costa, Veronica

PY - 2008/9/22

Y1 - 2008/9/22

N2 - This paper proposes and presents a comparison of scheduling algorithms applied to the context of load balancing the query traffic on distributed inverted files. We put emphasis on queries requiring intersection of posting lists, which is a very demanding case for the term partitioned inverted file and a case in which the document partitioned inverted file used by current search engines can perform very efficiently. We show that with proper scheduling of queries the term partitioned approach can outperform the document partitioned approach.

AB - This paper proposes and presents a comparison of scheduling algorithms applied to the context of load balancing the query traffic on distributed inverted files. We put emphasis on queries requiring intersection of posting lists, which is a very demanding case for the term partitioned inverted file and a case in which the document partitioned inverted file used by current search engines can perform very efficiently. We show that with proper scheduling of queries the term partitioned approach can outperform the document partitioned approach.

UR - http://www.scopus.com/inward/record.url?scp=51849128341&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-85451-7_47

DO - 10.1007/978-3-540-85451-7_47

M3 - Conference contribution

AN - SCOPUS:51849128341

SN - 3540854509

SN - 9783540854500

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 434

EP - 443

BT - Euro-Par 2008 Parallel Processing - 14th International Euro-Par Conference, Proceedings

T2 - 14th International Euro-Par Conference, Euro-Par 2008

Y2 - 26 August 2008 through 29 August 2008

ER -

Marin M, Gomez-Pantoja C, Gonzalez S, Gil-Costa V. Scheduling intersection queries in term partitioned inverted files. In Euro-Par 2008 Parallel Processing - 14th International Euro-Par Conference, Proceedings. 2008. p. 434-443. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-85451-7_47

Scheduling intersection queries in term partitioned inverted files

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this