Skip to main content

D-FOPA: A Dynamic Final Object Pruning Algorithm to Efficiently Produce Skyline Points Over Data Streams

  • Conference paper
  • First Online:
Database and Expert Systems Applications (Globe 2015, DEXA 2015)

Abstract

Emerging technologies that support sensor networks are making available large volumes of sensed data. Commonly, sensed data entries are characterized by several sensed attributes and can be related to static attributes; both sensed and static attributes can be represented using Vertically Partitioned Tables (VPTs). Skyline-based ranking techniques provide the basis to distinguish the entries that best meet a user condition, and allow for the pruning of the space of potential answers. We tackle the problem of efficiently computing the skyline over sensed and static data represented as Vertically Partitioned Tables (VPTs). We propose an algorithm named D-FOPA (Dynamic Final Object Pruning Algorithm), a rank-based approach able to dynamically adjust the skyline by processing changes on values of sensed attributes. We conducted an empirical study on datasets of synthetic sensed data, and the results suggest that D-FOPA is not only able to scale up to large datasets, but reduces average execution time and number of comparisons of state-of-the-art approaches by up to one order of magnitude.

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 EPUB and 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

Notes

  1. 1.

    The best value corresponds to the greatest amount of tables available.

  2. 2.

    The mpfo was found in newVPT and oldVPT in all dimensions, i.e., Parking spaces, Tables, Quality and Popularity.

  3. 3.

    Expiration events are sent from sensor network.

References

  1. Abadi, D., Marcus, A., Madden, S., Hollenbach, K.: Scalable semantic web data management using vertical partitioning. In: 32th International Conference of Very Large Data Bases (VLDB) (2007)

    Google Scholar 

  2. Alvarado, A., Baldizán, O., Vidal, M., Goncalves, M.: Fopa: A Final Object Pruning Algorithm to Efficiently Produce Skyline Points. Springer, Heidelberg (2013)

    Google Scholar 

  3. Balke, W., Guntzer, U.: Multi-objective query processing for database systems (2004)

    Google Scholar 

  4. Balke, W.-T., Güntzer, U., Zheng, J.X.: Efficient distributed skylining for web information systems. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 256–273. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. Börzsönyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: ICDE, pp. 334–348 (2001)

    Google Scholar 

  6. Fang, Y., Chan, C.-Y.: Efficient skyline maintenance for streaming data with partially-ordered domains. In: Kitagawa, H., Ishikawa, Y., Li, Q., Watanabe, C. (eds.) DASFAA 2010. LNCS, vol. 5981, pp. 322–336. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Chen, L., Gao, S., Anyanwu, K.: Efficiently evaluating skyline queries on RDF databases. In: Antoniou, G., Grobelnik, M., Simperl, E., Parsia, B., Plexousakis, D., De Leenheer, P., Pan, J. (eds.) ESWC 2011, Part II. LNCS, vol. 6644, pp. 123–138. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  8. Chomicki, J., Godfrey, P., Gryz, J., Liang, D.: Skyline with presorting. In: International Conference on Data, Engineering, pp. 717–719 (2003)

    Google Scholar 

  9. Kossmann, D., Ramsak, F., Rost, S.: Shooting stars in the sky: an online algorithm for skyline queries. In: International Conference on Very Large Databases (VLDB), pp. 275–286 (2003)

    Google Scholar 

  10. Lin, J., Wei, J.: Constrained skyline computing over data streams. In: IEEE International Conference on e-Bussiness Engineering (2008)

    Google Scholar 

  11. Papadias, D., Tao, Y., Fu, G., Seeger, B.: An optimal and progressive algorithm for skyline queries, pp. 467–478. ACM SIGMOD (2003)

    Google Scholar 

  12. Pu, Q., Lbath, A., He, D.: Location based recommendation for mobile users using language model and skyline query. Inf. Technol. Comput. Sci. (IJITCS) 4, 19–28 (2012)

    Google Scholar 

  13. Sarkas, N., Das, G., Koudas, N., Tung, A.K.: Categorical skylines for streaming data. In: SIGMOD, pp. 239–250 (2008)

    Google Scholar 

  14. Tan, K.N., Eng, P.K., Ooi, B.C.: Efficient proggressive skyline computation. In: International Conference on Very Large Databases (VLDB), pp. 301–310 (2001)

    Google Scholar 

  15. Tao, Y., Papadias, D.: Maintaining sliding window skylines on data streams. IEEE Trans. Knowl. Data Eng. 18(3), 377–391 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Stephanie Alibrandi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Alibrandi, S., Bravo, S., Goncalves, M., Vidal, ME. (2015). D-FOPA: A Dynamic Final Object Pruning Algorithm to Efficiently Produce Skyline Points Over Data Streams. In: Chen, Q., Hameurlain, A., Toumani, F., Wagner, R., Decker, H. (eds) Database and Expert Systems Applications. Globe DEXA 2015 2015. Lecture Notes in Computer Science(), vol 9262. Springer, Cham. https://doi.org/10.1007/978-3-319-22852-5_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-22852-5_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-22851-8

  • Online ISBN: 978-3-319-22852-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics