On top-k search with no random access using small memory

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

Volumn 5207 LNCS, Issue , 2008, Pages 97-111

  Gurský, Peter ^a   Vojtáš, Peter ^b  

^a P J AFÁRIK UNIVERSITY   (Slovakia)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Data much bigger than memory; No random access; TA sorted variants; Top k search; User query

Indexed keywords

DATABASE SYSTEMS; INFORMATION SYSTEMS;

DATA MUCH BIGGER THAN MEMORY; DATA SIZES; MEMORY SIZES; NO RANDOM ACCESS; RANDOM ACCESSES; TA-SORTED VARIANTS; USER QUERY;

RANDOM PROCESSES;

EID: 54249107385     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85713-6_8     Document Type: Conference Paper

References (22)

1. Akbarinia, R., Pacitti, E., Valduriez, P.: Best Position Algorithms for Top-k Queries. In: VLDB (2007)
2. Bast, H., Majumdar, D., Schenkel, R., Theobald, M., Weikum, G.: IO-Top-k: Index-Access Optimized Top-k Query Processing. In: VLDB (2006)
3. Balke, W., Güntzer, U.: Multi-objective Query Processing for Database Systems. In: VLDB (2004)
4. Bruno, N., Gravano, L., Marian, A.: Evaluating top-k queries over web-accessible databases. In: ICDE (2002)
5. Chang, K.C.C., Hwang, S.W.: Minimal probing: Supporting expensive predicates for top-k queries. In: SIGMOD (2002)
6. Fagin, R., Lotem, A., Naor, M.: Optimal Aggregation Algorithms for Middleware. In: ACM PODS (2001)
7. Gurský, P., Lencses, R., Vojtáš, P.: Algorithms for user dependent integration of ranked distributed information. In: TCGOV (2005)
8. Gurský, P., Šumák, M.: Top-k aggregator. In: Tools for Acquisition, Organisation and Presenting of Information and Knowledge, project proceedings (2006)
9. Gurský, P., Horváth, T., Novotný, R., Vaneková, V., Vojtáš, P.: UPRE: User preference based search system. In: IEEE/WIC/ACM Web Inteligence (2006)
10. Güntzer, U., Balke, W., Kiessling, W.: Towards efficient multi-feature queries in heterogeneous enviroments. In: ITCC (2001)
11. Horváth, T., Vojtáš, P.: Ordinal Classification with Monotonicity Constraints. In: Proc. 6th Industrial Conference on Data Mining ICDM (2006)
12. Hristidis, V., Papakonstantinou, Y.: Algorithms and Applications for answering Ranked Queries using Ranked Views. VLDB Journal 13(1) (2004)
13. Ilyas, I., Aref, W., Elmagarmid, A.: Supporting top-k join queries in relational database. In: VLDB (2003)
14. Ilyas, I., Shah, R., Aref, W.G., Vitter, J.S., Elmagarmid, A.K.: Rank-aware query optimization. In: SIGMOD (2004)
15. Li, C., Chang, K., Ilyas, I., Song, S.: RankSQL: Query algebra and optimization for relational top-k queries. In: SIGMOD (2005)
16. Ramakrishnan, R., Gherke, J.: Database management systems, 3rd edn. McGraw-Hill, New York (2003)
17. Soliman, M.A., Ilyas, I.F., Chang, K.C.C.: Top-k Query Processing in Uncertain Databases. In: Proc. ICDE (2007)
18. Re, C., Dalvi, N.N., Suciu, D.: Efficient Top-k Query Evaluation on Probabilistic Data. In: Proc. ICDE (2007)
19. Theobald, M., Schenkel, R., Weikum, G.: An Efficient and Versatile Query Engine for TopX Search. In: VLDB (2005)
20. Yu, H., Hwang, S., Chang, K.: Enabling Soft Queries for Data Retrieval. Information Systems. Elsevier, Amsterdam (2007)
21. Xin, D., Han, J., Chang, K.: Progressive and Selective Merge: Computing Top-K with Ad-Hoc Ranking Functions. In: SIGMOD (2007)
22. Zhang, Z., Hwang, S., Chang, K., Wang, M., Lang, C., Chang, Y.: Boolean + Ranking: Querying a Database by K-Constrained Optimization. In: SIGMOD (2006)