Abstract
Mobile services offering multi-feature query capabilities must meet tough response time requirements to gain customer acceptance. The top-k query model is a popular candidate to implement such services. We present a new algorithm SR-Combine that closely self-adapts to particular cost ratios in different environments optimizing both object accesses and query run-times. We perform a series of benchmarks to verify the superiority over existing approaches and use a psychologically founded model of response time requirements for mobile access. For a wide range of practical cases SR-Combine can already satisfy these goals. Where this isn’t yet the case, we show ways to get there systematically paving the way for real-time capabilities in mobile services.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
N. Bruno, L. Gravano, A. Marian: Evaluating Top-k Queries over Web-Accessible Databases. Intern. Conf. on Data Engineering (ICDE’02), San Jose, CA, USA, 2002.
W-T. Balke, W. Kießling, C. Unbehend: A situation-aware mobile traffic information prototype. Tech. Report 2002-14, Institute of Computer Science, University of Augsburg, Germany, 2002 (submitted for publication)
K. Böhm, M. Mlivoncic, H-J. Schek, R. Weber: Fast Evaluation Techniques for Complex Similarity Queries. Intern. Conf. on Very Large Databases (VLDB’01), Rome, Italy, 2001
Y. Chang, L. Bergman, V. Castelli, C. Li, M. Lo, J. Smith: The onion technique: indexing for linear optimization queries. Intern. Conf. on Management of Data (SIGMOD’00), Dallas, USA, 2000.
W. Cohen: Integration of Heterogeneous Databases Without Common Domains Using Queries Based on Textual Similarity. Intern. Conf. on Management of Data (SIGMOD’98), Seattle, USA, 1998.
J. Ding, L. Gravano, N. Shivakumar: Computing Geographical Scopes of Web Resources. Intern. Conf. on Very Large Databases (VLDB’00), Cairo, Egypt, 2000.
D. Donjerkovic and R. Ramakrishnan: Probabilistic optimization of top k queries. Intern. Conf. on Very Large Databases (VLDB’99), Edinburgh, Great Britain, 1999.
R. Fagin. Combining fuzzy information from multiple systems. Symposium on Principles of Database Systems (PODS’96), Montreal, Canada, 1996.
R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. Symposium on Principles of Database Systems(PODS’01), Santa Barbara, CA, USA, 2001.
S. Gribble and E. Brewer. System design issues for internet middleware services: deductions from a large client trace. USENIX Symposium on Internet Technologies and Systems, Monterey, CA, USA, 1997.
U. Güntzer, W-T. Balke, and W. Kießling: Optimizing multi-feature queries for image databases. Intern. Conf. on Very Large Databases (VLDB’00), Cairo, Egypt, 2000.
U. Güntzer, W-T. Balke, and W. Kießling: Towards efficient multi-feature queries in heterogeneous environments. Inter. Conf. on Information Technology: Coding and Computing (ITCC’01), Las Vegas, USA, 2001.
R. Goldman, J. Widom: WSQ/DSQ: A practical approach for combined querying of databases and the web. Intern. Conf. on Management of Data (SIGMOD’00), Dallas, USA, 2000.
W. Kießling: Foundations of preferences in database systems. Intern. Conf. on Very Large Databases (VLDB’02), Hong Kong, China, 2002.
S. Nepal and M. Ramakrishna: Query processing issues in image (multimedia) databases. Intern. Conf. on Data Engineering (ICDE’99), Sydney, Australia, 1999.
M. Ortega, Y. Rui, K. Chakrabarti, K. Porkaew, S. Mehrotra, and T. S. Huang: Supporting ranked boolean similarity queries in MARS. IEEE Transactions on Knowledge and Data Engineering (TKDE), Vol. 10 (6), 1998.
E. Pöppel, A hierachical model of temporal perception. Journal of Trends in Cognitive Science, Vol. 1, Elsevier, 1997
M. Tork Roth, P. Schwarz, L. Haas: An Architecture for Transparent Access to Diverse Data Sources. Compontent Database Systems, Morgan Kaufmann, 2001.
M. Wagner, W-T. Balke, and W. Kießling: An XML-based Multimedia Middleware for Mobile Online Auctions. Enterprise Information Systems III, Kluwer, 2002.
E. Wimmers, L. Haas, M. Tork Roth, C. Braendli: Using Fagin’s Algorithm for Merging Ranked Results in Multimedia Middleware. Intern. Conf. on Cooperative Information Systems (CoopIS’99), Edinburgh, Great Britain, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Balke, WT., Güntzer, U., Kießling, W. (2002). On Real-Time Top k Querying for Mobile Services. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems 2002: CoopIS, DOA, and ODBASE. OTM 2002. Lecture Notes in Computer Science, vol 2519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36124-3_8
Download citation
DOI: https://doi.org/10.1007/3-540-36124-3_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00106-5
Online ISBN: 978-3-540-36124-4
eBook Packages: Springer Book Archive