Caching Dynamic Skyline Queries

  • Dimitris Sacharidis
  • Panagiotis Bouros
  • Timos Sellis
Conference paper

DOI: 10.1007/978-3-540-69497-7_29

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5069)
Cite this paper as:
Sacharidis D., Bouros P., Sellis T. (2008) Caching Dynamic Skyline Queries. In: Ludäscher B., Mamoulis N. (eds) Scientific and Statistical Database Management. SSDBM 2008. Lecture Notes in Computer Science, vol 5069. Springer, Berlin, Heidelberg

Abstract

Given a query tuple q, the dynamic skyline query retrieves the tuples that are not dynamically dominated by any other in the data set with respect to q. A tuple dynamically dominates another, w.r.t. q, if it has closer to q’s values in all attributes, and has strictly closer to q’s value in at least one. The dynamic skyline query can be treated as a standard skyline query, subject to the transformation of all tuples’ values. In this work, we make the observation that results to past dynamic skyline queries can help reduce the computation cost for future queries. To this end, we propose a caching mechanism for dynamic skyline queries and devise a cache-aware algorithm. Our extensive experimental evaluation demonstrates the efficiency of this mechanism compared to standard techniques without caching.

Keywords

skyline dynamic skyline query caching 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Dimitris Sacharidis
    • 1
  • Panagiotis Bouros
    • 1
  • Timos Sellis
    • 1
    • 2
  1. 1.National Technical University of AthensAthensGreece
  2. 2.Institute for the Management of Information Systems — R.C. AthenaAthensGreece

Personalised recommendations