SHARED VS SEPARATE INVERTED FILES

被引：0
|
作者：
GRAZZINI, E [1 ]
PIPPOLINI, F [1 ]
机构：
[1] CNR, IST APPLICAZ MATEMAT, I-50134 FLORENCE, ITALY
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1989年 / 367卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：517 / 531
页数：15
相关论文
共 50 条
  • [21] Inverted files for text search engines
    Zobel, Justin
    Moffat, Alistair
    ACM COMPUTING SURVEYS, 2006, 38 (02)
  • [22] Probabilistic Static Pruning of Inverted Files
    Blanco, Roi
    Barreiro, Alvaro
    ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2010, 28 (01)
  • [23] SHARED RESULTS AND OPEN FILES WITH CLIENT
    BRODSKY, SL
    PROFESSIONAL PSYCHOLOGY, 1972, 3 (04): : 362 - 364
  • [24] FLOW COMPUTING - SHARED OR SEPARATE
    REEVE, A
    CONTROL AND INSTRUMENTATION, 1992, 24 (02): : 33 - &
  • [25] Efficient distributed algorithms to build inverted files
    Ribeiro-Neto, B
    Moura, ES
    Neubert, MS
    Ziviani, N
    SIGIR'99: PROCEEDINGS OF 22ND INTERNATIONAL CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 1999, : 105 - 112
  • [26] Parallel search using partitioned inverted files
    MacFarlane, A
    McCann, JA
    Robertson, SE
    SPIRE 2000: SEVENTH INTERNATIONAL SYMPOSIUM ON STRING PROCESSING AND INFORMATION RETRIEVAL - PROCEEDINGS, 2000, : 209 - 220
  • [27] Separate Spheres or Shared Dominions?
    Ross, Cathy
    TRANSFORMATION-AN INTERNATIONAL JOURNAL OF HOLISTIC MISSION STUDIES, 2006, 23 (04): : 228 - 235
  • [28] Factors hindering shared files retrieval
    Bergman, Ofer
    Israeli, Tamar
    Whittaker, Steve
    ASLIB JOURNAL OF INFORMATION MANAGEMENT, 2019, 72 (01) : 130 - 147
  • [29] Compression of boolean inverted files by document ordering
    Gelbukh, A
    Han, SY
    Sidorov, G
    2003 INTERNATIONAL CONFERENCE ON NATURAL LANGUAGE PROCESSING AND KNOWLEDGE ENGINEERING, PROCEEDINGS, 2003, : 244 - 249
  • [30] Parallel methods for the update of partitioned inverted files
    MacFarlane, A.
    McCann, J. A.
    Robertson, S. E.
    ASLIB PROCEEDINGS, 2007, 59 (4-5): : 367 - 396
12345