Efficient query expansion with auxiliary data structures

被引:8
|
作者
Billerbeck, Bodo [1 ]
Zobel, Justin [1 ]
机构
[1] RMIT Univ, Sch Comp Sci & Informat Technol, Melbourne, Vic, Australia
基金
澳大利亚研究理事会;
关键词
query expansion; efficiency; document surrogates; query associations;
D O I
10.1016/j.is.2005.11.002
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Query expansion is a well-known method for improving average effectiveness in information retrieval. The most effective query expansion methods rely on retrieving documents which are used as a source of expansion terms. Retrieving those documents is costly. We examine the bottlenecks of a conventional approach and investigate alternative methods aimed at reducing query evaluation time. We propose a new method that draws candidate terms from brief document summaries that are held in memory for each document. While approximately maintaining the effectiveness of the conventional approach, this method significantly reduces the time required for query expansion by a factor of 5-10. (C) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:573 / 584
页数:12
相关论文
共 50 条
  • [1] Constraint databases, data structures and efficient query evaluation
    Heintz, J
    Kuijpers, B
    CONSTRAINT DATABASES, PROCEEDINGS, 2004, 3074 : 1 - 24
  • [2] Techniques for efficient query expansion
    Billerbeck, B
    Zobel, J
    STRING PROCESSING AND INFORMATION RETRIEVAL, PROCEEDINGS, 2004, 3246 : 30 - 42
  • [3] Efficient Query Expansion for Advertisement Search
    Wang, Haofen
    Liang, Yan
    Fu, Linyun
    Xue, Gui-Rong
    Yu, Yong
    PROCEEDINGS 32ND ANNUAL INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2009, : 51 - 58
  • [4] POSTER: Two Concurrent Data Structures for Efficient Datalog Query Processing
    Jordan, Herbert
    Scholz, Bernhard
    Subotic, Pavle
    ACM SIGPLAN NOTICES, 2018, 53 (01) : 399 - 400
  • [5] POSTER: Two Concurrent Data Structures for Efficient Datalog Query Processing
    Jordan H.
    Scholz B.
    Subotic P.
    2018, Association for Computing Machinery, 2 Penn Plaza, Suite 701, New York, NY 10121-0701, United States (53): : 399 - 400
  • [6] Efficient query processing on relational data-partitioning index structures
    Kriegel, HP
    Kunath, P
    Pfeifle, M
    Renz, M
    16TH INTERNATIONAL CONFERENCE ON SCIENTIFIC AND STATISTICAL DATABASE MANAGEMENT, PROCEEDINGS, 2004, : 119 - 122
  • [7] Efficient and Effective Query Expansion for Web Search
    Lucchese, Claudio
    Nardini, Franco Maria
    Perego, Raffaele
    Trani, Roberto
    Venturini, Rossano
    CIKM'18: PROCEEDINGS OF THE 27TH ACM INTERNATIONAL CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2018, : 1551 - 1554
  • [8] Automatic query expansion using data manifold
    Yang, Lingpeng
    Ji, Donghong
    Nie, Yu
    He, Tingting
    INFORMATION RETRIEVAL TECHNOLOGY, PROCEEDINGS, 2006, 4182 : 659 - 665
  • [9] Efficient Association Rules Selecting for Automatic Query Expansion
    Bouziri, Ahlem
    Latiri, Chiraz
    Gaussier, Eric
    COMPUTATIONAL LINGUISTICS AND INTELLIGENT TEXT PROCESSING, CICLING 2017, PT II, 2018, 10762 : 563 - 574
  • [10] Bat Algorithm for Efficient Query Expansion: Application to MEDLINE
    Khennak, Ilyes
    Drias, Habiba
    NEW ADVANCES IN INFORMATION SYSTEMS AND TECHNOLOGIES, VOL 1, 2016, 444 : 113 - 122