Skip to main content
SpringerLink
Log in

Graph based Ranked Answers for Keyword Graph Structure

  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

Keyword query processing over graph structured data is beneficial across various real world applications. The basic unit, of search and retrieval, in keyword search over graph, is a structure (interconnection of nodes) that connects all the query keywords. This new answering paradigm, in contrast to single web page results given by search engines, brings forth new challenges for ranking. In this paper, we propose a simple but effective Fuzzy set theory based Ranking measure, called FRank. Fuzzy sets acknowledge the contribution of each individual query keyword, discretely, to enumerate node relevance. A novel aggregation operator is defined, to combine the content relevance based fuzzy sets and, compute query dependent edge weights. The final rank, of an answer, is computed by non-monotonic addition of edge weights, as per their relevance to keyword query. FRank evaluates each answer based on the distribution of query keywords and structural connectivity between those keywords. An extensive empirical analysis shows superior performance by our proposed ranking measure as compared to the ranking measures adopted by current approaches in the literature.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aditya, B., Bhalotia, G., Chakrabarti, S., Hulgeri, A., Nakhe, C., Parag, P. and Sudarshan, S., “BANKS: Browsing and Keyword Searching in Relational Databases,” in Proc. VLDB, pp. 1083–1086, 2002.

  2. Agrawal, S., Chaudhuri, S., Das, G., “DBXplorer: A System for Keyword-Based Search over Relational Databases,” in Proc. ICDE, pp. 5–16, 2002.

  3. Arora, N., Lee, W., Park, S., Leung, C., Kim, J. and Kumar, H., “Efficient Fuzzy Ranking for Keyword Search on Graphs,” in Proc. DEXA, pp. 502–510, 2012.

  4. Bompada, T., Chang, C. C., Chen, J., Kumar, R. and Shenoy, R., “On the Robustness of Relevance Measures with Incomplete Judgments,” in Proc. SIGIR, pp. 359–366, 2007.

  5. Bruno, N. and Wang, H., “The Threshold Algorithm: From Middleware Systems to the Relational Engine,” in IEEE Trans. on Knowledge and Data Eng., pp. 523–537, April 2007.

  6. Dalvi, B. B., Kshirsagar, M. and Sudarshan, S., “Keyword Search on External Memory Data Graphs,” in Proc. VLDB, pp. 1189–1204, 2008.

  7. Dupret, G. and Piwowarski, B., “Model Based Comparison of Discounted Cumulative Gain and Average Precision,” Journal of Discrete Algorithms, pp. 49–62, 2013.

  8. Fagin, R., “Combining Fuzzy Information from Multiple Systems,” in Proc. PODS, pp. 83–99, 1996.

  9. Guo, L., Shao, F., Botev, C. and Shanmugasundaram, J., “XRANK: Ranked Keyword Search Over XML Documents,” in Proc. SIGMOD, pp.16–27, 2003.

  10. He, H., Wang, H., Yang, J. and Philip, S. Y., “BLINKS: Ranked Keyword Searches on Graphs,” in Proc. SIGMOD, pp. 305–316, 2007.

  11. Hristidis, V. and Papakonstantinou, Y., “Discover: Keyword Search in Relational Databases,” in Proc. VLDB, pp. 670–681, 2002.

  12. Jarvelin, K., Price, S., Delcambre, L. and Nielsen, M., “Discounted Cumulated Gain Based Evaluation of Multiple-Query Information Retrieval Sessions,” in Proc. ECIR, pp. 4–15, 2008.

  13. Kacholia, V., Pandit, S., Chakrabarti, S., Sudarshan, S., Desai, R. and Karambelkar, H., “Bidirectional Expansion for Keyword Search on Graph Databases,” in Proc. VLDB, pp. 505–516, 2005.

  14. Kim, S., Lee, W., Arora, N. R., Jo, T. C., Kang, S. H., “Retrieving Keyworded Subgraphs with Graph Ranking Score,” Expert Systems with Applications, pp. 4647–4656, 2011.

  15. Lee, W., Leung, C. and Lee, J., “MobileWeb Navigation in Digital Ecosystems Using Rooted Directed Trees,” IEEE Trans. Indus. Elect., 58, 6, pp. 2154–2162, 2011.

    Google Scholar 

  16. Lee, W., Leung, C., Song, J. and Eom, C., “A Network-Flow Based Influence Propagation Model for Social Networks,” in Proc. CGC, pp. 601–608, 2012.

  17. Li, W. S., Candan, K. S., Vu, Q. and Agrawal, D., “Retrieving and Organizing Web Pages by Information Unit,” in Proc. WWW, pp. 230–244, 2001.

  18. Li, C. and Chiang, T. W., “Function Approximation with Complex Neuro-Fuzzy System Using Complex Fuzzy Sets; A New Approach,” New Generation Computing, pp. 151–156, 2011.

  19. Li, G., Ooi, B. C., Feng, J., Wang, J. and Zhou, L., “EASE: an Effective 3-in-1 Keyword Search Method for Unstructured, Semi-structured and Structured Data,” in Proc. SIGMOD, pp. 903–914, 2008.

  20. Liu, F., Yu, C., Meng, W. and Chowdhury, A., “Effective Keyword Search in Relational Databases,” in Proc. SIGMOD, pp. 563–574, 2006.

  21. Luo, Y., Lin, X., Wang, W. and Zhou, X., “Spark: Top-k Keyword Query in Relational Databases,” in Proc. SIGMOD, pp. 115–126, 2007.

  22. Ma, Z. M. and Yan, L., “Fuzzy XML Data Modeling with the UML and Relational Data Models,” Data Knowledge Engineering, pp. 972–996, December 2007.

  23. Matveeva, I., Burges, C., Burkard, T., Laucius, A., Wong, L., “High Accuracy Retrieval with Multiple Nested Ranker,” in Proc. SIGIR, pp. 437–444, 2006.

  24. Moussalli, R., Salloum, M., Najjar, W. and Tsotras, V., “Massively Parallel XML Twig Filtering Using Dynamic Programming on FPGAs,” in Proc. ICDE, pp. 948–959, 2011.

  25. Qin, L., Jeffrey, X. Y., Chang, L. and Yufei, T., “Querying Communities in Relational Databases,” in Proc. ICDE, pp. 724–735, 2009.

  26. Sanchez, D., Castella-Roca, J. and Viejo, A., “Knowledge-based Scheme to Create Privacy-preserving but Semantically-related Queries for Web Search Engines,” Information Science, pp.17–30, 2013.

  27. Setek, M. and Trawinski, B., “Selection of Heterogeneous Fuzzy Model Ensembles Using Self-adaptive Genetic Algorithms,” New Generation Computing, pp. 309–327, 2011.

  28. Song, Y., Zhou, D. and He, L., “Post-ranking Query Suggestion by Diversifying Search Results,” in Proc. SIGIR, pp. 815–824, 2011.

  29. Suganuma, S., Huynh, V. N., Nakamori, Y. and Wang, S., “A Fuzzy Set based Approach to Generalized Landscape Theory of Aggregation,” New Generation Computing, pp. 57–66, 2005.

  30. Talukdar, P. P., Jacob, M., Mehmood, M. S., Crammer, K., Ives, Z. G., Pereira, F. and Guha, S., “Learning to Create Data-integrating Queries,” in Proc. VLDB, pp. 785–796, 2008.

  31. Yildirim, Y., Yazici, A. and Yilmaz, T., “Automatic Semantic Content Extraction in Videos Using a Fuzzy Ontology and Rule-Based Model,” IEEE Trans. Knowl. Data Eng., 25, 1, pp.47–61, 2013.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INHA University, Incheon, South Korea

    Nidhi R. Arora & Wookey Lee

Authors
  1. Nidhi R. Arora
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wookey Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wookey Lee.

About this article

Cite this article

Arora, N.R., Lee, W. Graph based Ranked Answers for Keyword Graph Structure. New Gener. Comput. 31, 115–134 (2013). https://doi.org/10.1007/s00354-013-0203-6

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00354-013-0203-6

Keywords

Search

Navigation