Skip to main content

Skyline Snippets

  • Conference paper
Flexible Query Answering Systems (FQAS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7022))

Included in the following conference series:

Abstract

There is a strong demand for a deep personalization of search systems for many Internet applications. In this respect the proper handling of user preferences plays an important role. Here we focus on the efficient evaluation of the Pareto preference operator for structured data in very large databases. The result set of such a Pareto query, also known as the “skyline”, tends to become very large for higher dimensionalities. Often it is too time-consuming or just not necessary to compute the entire skyline, instead only some fraction of it, called a “snippet”, is sufficient. In this paper we contribute a novel algorithm for a fast computation of such skyline snippets. Our solutions do not rely on the availability of specialized pre-computed indexes, hence are generally applicable. We demonstrate the performance of our approach by several benchmarks studies. The presented results suggest that even for complex Pareto queries, yielding very large skylines, snippets can be computed sufficiently fast, and therefore can be integrated into online Web services.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brafman, R.I., Domshlak, C.: Preference Handling: An Introductory Tutorial. AI Magazine 30(1) (2008)

    Google Scholar 

  2. Kießling, W., Köstler, G.: Preference SQL - Design, Implementation, Experiences. In: VLDB 2002: Proceedings of the 28th International Conference on Very Large Data Bases, pp. 990–1001. VLDB Endowment, Hong Kong (2002)

    Google Scholar 

  3. Hafenrichter, B., Kießling, W.: Optimization of Relational Preference Queries. In: ADC 2005: Proceedings of the 16th Australasian Database Conference, Darlinghurst, Australia, pp. 175–184. Australian Computer Society, Inc. (2005)

    Google Scholar 

  4. Chomicki, J.: Preference Formulas in Relational Queries. In: TODS 2003: ACM Transactions on Database Systems, vol. 28, pp. 427–466. ACM Press, New York (2003)

    Google Scholar 

  5. Preisinger, T., Kießling, W.: The Hexagon Algorithm for Evaluating Pareto Preference Queries. In: MPref 2007: Proceedings of the 3rd Multidisciplinary Workshop on Advances in Preference Handling (in Conjunction with VLDB 2007) (2007)

    Google Scholar 

  6. Endres, M., Kießling, W.: Semi-Skyline Optimization of Constrained Skyline Queries. In: ADC 2011: Proceedings of the 22nd Australasian Database Conference. Australian Computer Society (2011)

    Google Scholar 

  7. Pei, J., Jin, W., Ester, M., Tao, Y.: Catching the Best Views of Skyline: A Semantic Approach Based on Decisive Subspaces. In: VLDB 2005: Proceedings of the 31st International Conference on Very Large Data Bases, pp. 253–264. ACM, New York (2005)

    Google Scholar 

  8. Yuan, Y., Lin, X., Liu, Q., Wang, W., Yu, J. X., Zhang, Q.: Efficient Computation of the Skyline Cube. In: VLDB 2005: Proceedings of the 31st International Conference on Very Large Data Bases, pp. 241–252. VLDB Endowment (2005)

    Google Scholar 

  9. Tao, Y., Xiao, X., Pei, J.: SUBSKY: Efficient Computation of Skylines in Subspaces. In: ICDE 2006: Proceedings of the 22nd International Conference on Data Engineering, p. 65. IEEE Computer Society, Los Alamitos (2006)

    Google Scholar 

  10. Tan, K.-L., Eng, P.-K., Ooi, B.C.: Efficient Progressive Skyline Computation. In: VLDB 2001: Proceedings of the 27th International Conference on Very Large Data Bases, pp. 301–310. Morgan Kaufmann Publishers Inc., San Francisco (2001)

    Google Scholar 

  11. Papadias, D., Tao, Y., Fu, G., Seeger, B.: Progressive Skyline Computation in Database Systems. ACM Trans. Database Syst. 30(1), 41–82 (2005)

    Article  Google Scholar 

  12. Lo, E., Yip, K.Y., Lin, K.-I., Cheung, D.W.: Progressive skylining over Web-accessible databases. IEEE Transactions on Knowledge and Data Engineering 57(2), 122–147 (2006)

    Article  Google Scholar 

  13. Brando, C., Goncalves, M., González, V.: Evaluating Top-k Skyline Queries over Relational Databases. In: Wagner, R., Revell, N., Pernul, G. (eds.) DEXA 2007. LNCS, vol. 4653, pp. 254–263. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  14. Chan, C.Y., Jagadish, H.V., Tan, K.-L., Tung, A.K.H., Zhang, Z.: On High Dimensional Skylines. In: Ioannidis, Y., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., Böhm, K., Kemper, A., Grust, T., Böhm, C. (eds.) EDBT 2006. LNCS, vol. 3896, pp. 478–495. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  15. Kießling, W.: Foundations of Preferences in Database Systems. In: VLDB 2002: Proceedings of the 28th International Conference on Very Large Data Bases, pp. 311–322. VLDB Endowment, Hong Kong (2002)

    Google Scholar 

  16. Kießling, W.: Preference Queries with SV-Semantics. In: Haritsa, J.R., Vijayaraman, T.M. (eds.) COMAD 2005: Advances in Data Management 2005, Proceedings of the 11th International Conference on Management of Data, pp. 15–26. Computer Society of India, Goa (2005)

    Google Scholar 

  17. Börzsönyi, S., Kossmann, D., Stocker, K.: The Skyline Operator. In: ICDE 2001: Proceedings of the 17th International Conference on Data Engineering, pp. 421–430. IEEE Computer Society, Washington, DC, USA (2001)

    Google Scholar 

  18. Pei, J., Yuan, Y., Lin, X., Jin, W., Ester, M., Liu, Q.: Towards Multidimensional Subspace Skyline Analysis. ACM Trans. Database Syst. 31(4), 1335–5915 (2006)

    Article  Google Scholar 

  19. Morse, M., Patel, J.M., Jagadish, H.V.: Efficient Skyline Computation over Low-Cardinality Domains. In: VLDB 2007: Proceedings of the 33rd International Conference on Very Large Data Bases, pp. 267–278. VLDB Endowment (2007)

    Google Scholar 

  20. Endres, M., Kießling, W.: Semi-Skylines and Skyline Snippets. Technical Report 2010-1, Institute of Computer Science. University of Augsburg (2010)

    Google Scholar 

  21. Lee, J., You, G.w., Hwang, S.w.: Telescope: Zooming to Interesting Skylines. In: Kotagiri, R., Radha Krishna, P., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol. 4443, pp. 539–550. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Endres, M., Kießling, W. (2011). Skyline Snippets. In: Christiansen, H., De Tré, G., Yazici, A., Zadrozny, S., Andreasen, T., Larsen, H.L. (eds) Flexible Query Answering Systems. FQAS 2011. Lecture Notes in Computer Science(), vol 7022. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24764-4_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24764-4_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24763-7

  • Online ISBN: 978-3-642-24764-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics