Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1982185.1982400acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
poster

Exact top-k keyword search on graph databases

Published: 21 March 2011 Publication History

Abstract

In this paper, by modifying an existing graph-database keyword search algorithm DPBF [1] in a straightforward strategy, we propose such an algorithm that can find exact top-k answers, with eliminating redundant answers, in an exact ranked order in O((2l+1mk + 3lnk · logk)log(2lnk)) run time (l: the number of keywords; k: top-k; n: the number of nodes in the graph database; m: the number of edges in the graph database) with the space complexity of O(2l+1nk).

References

[1]
B. Ding, J. X. Yu, L. Qin, X. Zhang, and X. Lin. Finding Top-k Min-Cost Connected Trees in Databases. In proc. of the 23<sup>rd</sup> International Conference on Data engineering (ICDE'07), 2007, 836--845.
[2]
H. He, H. Wang, J. Yang and P. S. Yu. BLINKS ranked Keyword Searches on Graphs. In SIGMOD'07, 2007, 305--316.
[3]
K. Golenberg, B. Kimelfeld and Y. Sagiv. Keyword Proximity Search in Complex Data Graphs. In ACM SIGMOD'08, 2008, 927--940.
[4]
M. R. Wang, L. R. Zhang and T. Ohmori. A report on Top-k keyword search algorithms with redundancy elimination on graph databases. In IPSJ SIG Technical Report (DBS-151-28) Japan. 2010. Nov.

Index Terms

  1. Exact top-k keyword search on graph databases

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SAC '11: Proceedings of the 2011 ACM Symposium on Applied Computing
    March 2011
    1868 pages
    ISBN:9781450301138
    DOI:10.1145/1982185

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 21 March 2011

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. graph database
    2. keyword search
    3. top-k

    Qualifiers

    • Poster

    Conference

    SAC'11
    Sponsor:
    SAC'11: The 2011 ACM Symposium on Applied Computing
    March 21 - 24, 2011
    TaiChung, Taiwan

    Acceptance Rates

    Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

    Upcoming Conference

    SAC '25
    The 40th ACM/SIGAPP Symposium on Applied Computing
    March 31 - April 4, 2025
    Catania , Italy

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 214
      Total Downloads
    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 23 Dec 2024

    Other Metrics

    Citations

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media