Skip to main content

A Temporal Dominant Relationship Analysis Method

  • Conference paper
  • 2480 Accesses

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

Abstract

Recent research on skyline queries has attracted much interest in the database and data mining community. The concept of dominant relationship analysis has commonly used in the context of skyline computation, due to its importance in many applications. Current methods have only considered so-called min/max hard attributes like price and quality which a user wants to minimize or maximize. However, objects can also have temporal attribute which can be used to represent relevant constraints on the query results. In this paper, we introduce novel skyline query types taking into account not only min/max hard attributes but also temporal attribute and the relationships between these different attribute types. We find the interrelated connection between the time-evolving attributes and the dominant relationship. Based on this discovery, we define the novel dominant relationship based on temporal aggregation and use it to analyze the problem of positioning a product in a competitive market while the time frame is required. We propose a new and efficient method to process temporal aggregation dominant relationship queries using corner transformation. Our experimental evaluation using a real dataset and various synthetic datasets demonstrates that the new query types are indeed meaningful and the proposed algorithms are efficient and scalable.

This research is partly supported by the National Science Foundation of China (60673138, 60603046), Key Program of Science Technology Research of MOE (106006), and Program for New Century Excellent Talents in University.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ramsak, F., Kossmann, D., Rost, S.: Shooting stars in the sky: An online algorithm for skyline queries. In: VLDB (2002)

    Google Scholar 

  2. Papadias, D., Tao, Y., Fu, G., Seeger, B.: An optimal and progressive algorithm for skyline queries. In: SIGMOD (2003)

    Google Scholar 

  3. Tan, K., et al.: Efficient progressive skyline computation. In: VLDB (2001)

    Google Scholar 

  4. Kossmann, D., Borzsonyi, S., Stocker, K.: The skyline operator. In: ICDE (2001)

    Google Scholar 

  5. Lin, W.W.X., Yuan, Y., Lu, H.: Stabbing the sky: efficient skyline computation over sliding windows. In: ICDE (2005)

    Google Scholar 

  6. Kieling, W.: Foundations of preferences in database systems. In: VLDB, pp. 311–322 (2002)

    Google Scholar 

  7. Li, C., Ooi, B.C., Tung, A.K.H., Wang, S.: DADA: A data cube for dominant relationship analysis. In: SIGMOD, pp. 659–670 (2006)

    Google Scholar 

  8. Balke, W.T., Guentzer, U., Zheng, J.X.: Efficient distributed skylining for web information systems. In: EDBT, pp. 256–273 (2004)

    Google Scholar 

  9. Chomicki, J., Godfrey, P., Gryz, J., Liang, D.: Skyline with presorting. In: ICDE, pp. 717–719 (2003)

    Google Scholar 

  10. Yuan, Y., Lin, X., Liu, Q., Wang, W., Yu, J.X., Zhang, Q.: Efficient computation of the skyline cube. In: VLDB, pp. 241–252 (2005)

    Google Scholar 

  11. Pei, J., Jin, W., Ester, M., Tao, Y.: Catching the best views of skyline: A semantic approach based on decisive subspaces. In: VLDB, pp. 253–264 (2005)

    Google Scholar 

  12. Chan, C.Y., Jagadish, H.V., Tan, K.L., Tung, A.K.H., Zhang, Z.: Finding k-Dominant skylines in high dimensional space. In: SIGMOD, pp. 503–514 (2006)

    Google Scholar 

  13. Seeger, B., Kriegel, H.-P.: Techniques for Design and Implementation of Efficient Spatial Access Methods. In: Proc. the 14th Int’l Conf. on Very Large Data Bases, Los Angeles, California, August 1988, pp. 360–371 (1988)

    Google Scholar 

  14. Ho, C.-T., Agrawal, R., Megiddo, N., Srikant, R.: Range queries in olap data cubes. In: SIGMOD Conference, pp. 73–88 (1997)

    Google Scholar 

  15. Beyer, K.S., Ramakrishnan, R.: Bottom-up computation of sparse and iceberg cubes. In: SIGMOD 1999, Proceedings ACM SIGMOD International Conference on Management of Data, Philadelphia, Pennsylvania, USA, June 1-3, 1999, pp. 359–370 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, J., Wu, Y., Li, C., Chen, H., Qu, B. (2008). A Temporal Dominant Relationship Analysis Method. In: Tang, C., Ling, C.X., Zhou, X., Cercone, N.J., Li, X. (eds) Advanced Data Mining and Applications. ADMA 2008. Lecture Notes in Computer Science(), vol 5139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88192-6_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88192-6_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88191-9

  • Online ISBN: 978-3-540-88192-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics