Skip to main content

Ranking Objects Based on Attribute Value Correlation

  • Conference paper
  • 895 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6262))

Abstract

There has been a great deal of interest in recent years on ranking query results in relational databases. This paper presents a novel method to rank objects (e.g., tuples) by exploiting the correlations among their attribute values. Given a query, each attribute value is assigned a score according to mutual occurrences with the query and its distribution status in the columns of the attribute. These attribute value scores are aggregated to get a final score for an object. Furthermore, a concept vector is proposed to provide a synopsis of the attribute value in a given database. A concept vector is utilized to get the similar objects. Experimental results demonstrate the performance of our ranking method, RAVC (Ranking with Attribute Value Correlation), in terms of search quality and efficiency.

This research was supported by the MKE(The Ministry of Knowledge Economy), Korea, under the ITRC(Information Technology Research Center) support program supervised by the NIPA(National IT Industry Promotion Agency). (grant number NIPA-2009-C1090-0902-0031).

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, S., Chaudhuri, S., Das, G.: DBXplorer: A System for Keyword-Based Search over Relational Databases. In: 18th IEEE International Conference on Data Engineering, pp. 5–16. IEEE Press, New York (2002)

    Google Scholar 

  2. Agrawal, S., Chaudhuri, S., Das, G., Gionis, A.: Automated Ranking of Database Query Results. In: First Biennial Conference on Innovative Data Systems Research, pp. 888–899. ACM Press, New York (2003)

    Google Scholar 

  3. Bhalotia, G., Hulgeri, A., Nakhe, C., Chakrabarti, S., Sudarshan, S.: Keyword Searching and Browsing in Databases using BANKS. In: 18th IEEE International Conference on Data Engineering, pp. 431–440. IEEE Press, New York (2002)

    Google Scholar 

  4. Chaudhuri, S., Das, G., Hristidis, V., Weikum, G.: Probabilistic Information Retrieval Approach for Ranking of Database Systems. ACM TODS 31(3), 1134–1168 (2006)

    Article  Google Scholar 

  5. Das, G., Hristidis, V., Kapoor, N.S., Sudarshan, S.: Ordering the Attributes of Query Results. In: 26th ACM SIGMOD International Conference on Management of Data, pp. 395–406. ACM Press, New York (2006)

    Chapter  Google Scholar 

  6. Hristidis, V., Papakonstantinou, Y.: DISCOVER: Keyword Search in Relational Databases. In: 28th International Conference of Very Large Data Bases, pp. 670–681. VLDB Endowment, New York (2002)

    Chapter  Google Scholar 

  7. Huhtala, Y., Karkkainen, J., Porkka, P., Toivonen, H.: TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies. Comput. J. 42(2), 100–111 (1999)

    Article  MATH  Google Scholar 

  8. Manning, C.D., Raghavan, P., Schtze, H.: Introduction to Information Retrieval. Cambridge University Press, New York (2008)

    MATH  Google Scholar 

  9. Meng, X., Ma, Z.M., Yan, L.: Answering Approximate Queries over Autonomous Web Databases. In: 18th International World Wide Web Conference, pp. 1021–1030. ACM Press, New York (2009)

    Chapter  Google Scholar 

  10. Nambiar, U., Kambhampati, S.: Answering Imprecise Queries over Autonomous Web Databases. In: 22th IEEE International Conference on Data Engineering, pp. 45–55. IEEE Press, New York (2006)

    Google Scholar 

  11. Binderberge, M.O., Chakrabarti, K., Mehrotra, S.: An Approach to Integrating Query Refinement in SQL. In: Jensen, C.S., Jeffery, K., Pokorný, J., Šaltenis, S., Bertino, E., Böhm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol. 2287, pp. 15–33. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  12. Shannon, C.E.: A Mathematical Theory of Communication. SIGMOBILE Mob. Comput. Commun. 5(1), 3–55 (2001)

    Article  Google Scholar 

  13. Su, W., Wang, J., Huang, Q., Lochovsky, F.: Query Result Ranking over E-commerce Web Databases. In: 15th ACM CIKM International Conference on Information and Knowledge Management, pp. 575–584. ACM Press, New York (2006)

    Chapter  Google Scholar 

  14. Yong, R., Huang, T.S., Mehrotra, S.: Content-based Image Retrieval with Relevance Feedback in MARS. In: 4th IEEE International Conference on Image Processing, pp. 815–818. ACM Press, New York (1997)

    Google Scholar 

  15. Xu, J., Croft, W.B.: Expansion using Local and Global Document Analysis. In: 19th ACM SIGIR International Conference on Research and Development in Information Retrieval, pp. 4–11. ACM Press, New York (1996)

    Chapter  Google Scholar 

  16. Yahoo! Autos, http://autos.yahoo.com

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Park, J., Lee, Sg. (2010). Ranking Objects Based on Attribute Value Correlation. In: Bringas, P.G., Hameurlain, A., Quirchmayr, G. (eds) Database and Expert Systems Applications. DEXA 2010. Lecture Notes in Computer Science, vol 6262. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15251-1_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15251-1_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15250-4

  • Online ISBN: 978-3-642-15251-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics