Scalable ranking for preference queries

Ying Feng, Divyakant Agrawal, Amr El Abbadi, Ambuj Singh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Top-k preference queries with multiple attributes are critical for decision-making applications. Previous research has concentrated on improving the computational efficiency mainly by using novel index structures and search strategies. Since current applications need to scale to terabytes of data and thousands of users, performance of such systems is strongly impacted by the amount of available memory. This paper proposes a scalable approach for memory-bounded top-k query processing.

Original languageEnglish
Title of host publicationInternational Conference on Information and Knowledge Management, Proceedings
Pages313-314
Number of pages2
DOIs
Publication statusPublished - 1 Dec 2005
Externally publishedYes
EventCIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management - Bremen, Germany
Duration: 31 Oct 20055 Nov 2005

Other

OtherCIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management
CountryGermany
CityBremen
Period31/10/055/11/05

Fingerprint

Top-k
Ranking
Query
Search strategy
Decision making
Bounded memory
Query processing

Keywords

  • Preference queries
  • Query Optimization

ASJC Scopus subject areas

  • Business, Management and Accounting(all)

Cite this

Feng, Y., Agrawal, D., El Abbadi, A., & Singh, A. (2005). Scalable ranking for preference queries. In International Conference on Information and Knowledge Management, Proceedings (pp. 313-314) https://doi.org/10.1145/1099554.1099643

Scalable ranking for preference queries. / Feng, Ying; Agrawal, Divyakant; El Abbadi, Amr; Singh, Ambuj.

International Conference on Information and Knowledge Management, Proceedings. 2005. p. 313-314.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Feng, Y, Agrawal, D, El Abbadi, A & Singh, A 2005, Scalable ranking for preference queries. in International Conference on Information and Knowledge Management, Proceedings. pp. 313-314, CIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management, Bremen, Germany, 31/10/05. https://doi.org/10.1145/1099554.1099643
Feng Y, Agrawal D, El Abbadi A, Singh A. Scalable ranking for preference queries. In International Conference on Information and Knowledge Management, Proceedings. 2005. p. 313-314 https://doi.org/10.1145/1099554.1099643
Feng, Ying ; Agrawal, Divyakant ; El Abbadi, Amr ; Singh, Ambuj. / Scalable ranking for preference queries. International Conference on Information and Knowledge Management, Proceedings. 2005. pp. 313-314
@inproceedings{c7d25bbfafe242dc8ac65cf3c4af0e43,
title = "Scalable ranking for preference queries",
abstract = "Top-k preference queries with multiple attributes are critical for decision-making applications. Previous research has concentrated on improving the computational efficiency mainly by using novel index structures and search strategies. Since current applications need to scale to terabytes of data and thousands of users, performance of such systems is strongly impacted by the amount of available memory. This paper proposes a scalable approach for memory-bounded top-k query processing.",
keywords = "Preference queries, Query Optimization",
author = "Ying Feng and Divyakant Agrawal and {El Abbadi}, Amr and Ambuj Singh",
year = "2005",
month = "12",
day = "1",
doi = "10.1145/1099554.1099643",
language = "English",
isbn = "1595931406",
pages = "313--314",
booktitle = "International Conference on Information and Knowledge Management, Proceedings",

}

TY - GEN

T1 - Scalable ranking for preference queries

AU - Feng, Ying

AU - Agrawal, Divyakant

AU - El Abbadi, Amr

AU - Singh, Ambuj

PY - 2005/12/1

Y1 - 2005/12/1

N2 - Top-k preference queries with multiple attributes are critical for decision-making applications. Previous research has concentrated on improving the computational efficiency mainly by using novel index structures and search strategies. Since current applications need to scale to terabytes of data and thousands of users, performance of such systems is strongly impacted by the amount of available memory. This paper proposes a scalable approach for memory-bounded top-k query processing.

AB - Top-k preference queries with multiple attributes are critical for decision-making applications. Previous research has concentrated on improving the computational efficiency mainly by using novel index structures and search strategies. Since current applications need to scale to terabytes of data and thousands of users, performance of such systems is strongly impacted by the amount of available memory. This paper proposes a scalable approach for memory-bounded top-k query processing.

KW - Preference queries

KW - Query Optimization

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

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

U2 - 10.1145/1099554.1099643

DO - 10.1145/1099554.1099643

M3 - Conference contribution

AN - SCOPUS:33745782989

SN - 1595931406

SN - 9781595931405

SP - 313

EP - 314

BT - International Conference on Information and Knowledge Management, Proceedings

ER -