IDEAS home Printed from https://ideas.repec.org/a/igg/jdwm00/v8y2012i4p41-81.html
   My bibliography  Save this article

Efficient and Effective Aggregate Keyword Search on Relational Databases

Author

Listed:
  • Luping Li

    (Baidu, Inc., Beijing, China)

  • Stephen Petschulat

    (SAP Business Objects, Coquitlam, BC, Canada)

  • Guanting Tang

    (School of Computing Science, Simon Fraser University, Burnaby, BC, Canada)

  • Jian Pei

    (School of Computing Science, Simon Fraser University, Burnaby, BC, Canada)

  • Wo-Shun Luk

    (School of Computing Science, Simon Fraser University, Burnaby, BC, Canada)

Abstract

Keyword search on relational databases is useful and popular for many users without technical background. Recently, aggregate keyword search on relational databases was proposed and has attracted interest. However, two important problems still remain. First, aggregate keyword search can be very costly on large relational databases, partly due to the lack of efficient indexes. Second, finding the top-k answers to an aggregate keyword query has not been addressed systematically, including both the ranking model and the efficient evaluation methods. In this paper, the authors tackle these two problems to improve the efficiency and effectiveness of aggregate keyword search on large relational databases. They designed indexes efficient in both size and construction time. The authors propose a general ranking model and an efficient ranking algorithm. They also report a systematic performance evaluation using real data sets.

Suggested Citation

  • Luping Li & Stephen Petschulat & Guanting Tang & Jian Pei & Wo-Shun Luk, 2012. "Efficient and Effective Aggregate Keyword Search on Relational Databases," International Journal of Data Warehousing and Mining (IJDWM), IGI Global, vol. 8(4), pages 41-81, October.
    • Handle: RePEc:igg:jdwm00:v:8:y:2012:i:4:p:41-81
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdwm.2012100103
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jdwm00:v:8:y:2012:i:4:p:41-81. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.