Article

Free access

The efficiency of inverted index and cluster searches

Author:

SIGIR '86: Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval

Pages 164 - 174

https://doi.org/10.1145/253168.253203

Published: 01 September 1986 Publication History

PDF eReader

Abstract

The processing time and disk space requirements of an inverted index and top-down cluster search are compared. The cluster search is shown to use both more time and more disk space, mostly due to the large number of cluster centroids needed by the search. When shorter centroids are used, the efficiency of the cluster search improves, but the inverted index search remains more efficient.

References

[1]

Buckley, C. A., Lewit, A. F., "Optimization of Inverted Vector Searches", Proceedings of the Eighth Annual International ACM 8{GIR Conference on Research and Development in Information Retrieval, pages 97-110,1985. ACM order number 606850.

Digital Library

Google Scholar

[2]

Fox, E. A., "Characterization of Two New Experimental Collections in Computer and Information Science Containing Textual and Bibliographic Concepts", Technical report 83-560, Department of Computer Science, Cornell University, September 1983.

Google Scholar

[3]

Griffiths, A., Robinson, L. A., Willett, P., "Hierarchic Agglomerative Clustering Methods for Automatic Document Classification", The Journal of Documentation XL(3):175-205,1984.

Crossref

Google Scholar

[4]

Griffiths, A., Luckhurst, H. C., Willett, P., "Using Interdocument Similarity Information in Document Retrieval Systems", Journal of the American Society for Information Science XXXVII(1):3-11, 1986.

Crossref

Google Scholar

[5]

Jardine, N., van Rijsbergen, C. J., #Phe Use of Hierarchic Clustering in Information Retrieval", Information Storage and Retrieval VII(5):217- 240, 1971.

Crossref

Google Scholar

[6]

Salton, G., editor, The SMART Retrieval System: Experiments in Automatic Document Processing. Prentice-Hall, 1971.

Digital Library

Google Scholar

[7]

Voorhees, E. M., The Effectiveness and Efficiency of Agglomerative Hierarchic Ctustering in Document Retrieval, PhD thesis, Cornell University, 1986.

Digital Library

Google Scholar

Cited By

View all

Devezas JNunes S(2020)Characterizing the hypergraph-of-entity and the structural impact of its extensionsApplied Network Science10.1007/s41109-020-00320-z5:1Online publication date: 27-Oct-2020
https://doi.org/10.1007/s41109-020-00320-z
Devezas JNunes S(2019)Characterizing the Hypergraph-of-Entity Representation ModelComplex Networks and Their Applications VIII10.1007/978-3-030-36683-4_1(3-14)Online publication date: 25-Nov-2019
https://doi.org/10.1007/978-3-030-36683-4_1
(2017)Semantically linking events for massive scientific literature researchThe Electronic Library10.1108/EL-09-2016-019835:4(724-744)Online publication date: 7-Aug-2017
https://dl.acm.org/doi/10.1108/EL-09-2016-0198
Show More Cited By

The efficiency of inverted index and cluster searches
1. Information systems
  1. Information retrieval
    1. Search engine architectures and scalability

Recommendations

The Efficiency of Inverted Index and Cluster Searches
Inverted index maintenance strategy for flashSSDs

An inverted index is a core data structure of Information Retrieval systems, especially in search engines. Since the search environments have become more dynamic, many on-line index maintenance strategies have been proposed. Previous strategies were ...
Cluster validity index: Comparative study and a new validity index with high performance
LOPAL '18: Proceedings of the International Conference on Learning and Optimization Algorithms: Theory and Applications

Cluster validity indexes are used to identify the best partitioning in a dataset from the results of a clustering algorithm. The overlap phenomenon is a source of failure for most of these validity indexes.

In this work, we propose a new validity index ...

Comments

Information & Contributors

Information

Published In

SIGIR '86: Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval

September 1986

283 pages

ISBN:0897911873

DOI:10.1145/253168

Chairman:
Luigi Rossi Bernardi
CNR, Italy
,
Editor:
Fausto Rabitti
IEI-CNR, Italy

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 1986

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

Wikisym05

Sponsor:

SIGIR

Wikisym05: Int'l Symposium on Wikis

Palazzo dei Congressi, Pisa, Italy

Acceptance Rates

Overall Acceptance Rate 792 of 3,983 submissions, 20%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
799
Total Downloads

Downloads (Last 12 months)52
Downloads (Last 6 weeks)6

Reflects downloads up to 04 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Devezas JNunes S(2020)Characterizing the hypergraph-of-entity and the structural impact of its extensionsApplied Network Science10.1007/s41109-020-00320-z5:1Online publication date: 27-Oct-2020
https://doi.org/10.1007/s41109-020-00320-z
Devezas JNunes S(2019)Characterizing the Hypergraph-of-Entity Representation ModelComplex Networks and Their Applications VIII10.1007/978-3-030-36683-4_1(3-14)Online publication date: 25-Nov-2019
https://doi.org/10.1007/978-3-030-36683-4_1
(2017)Semantically linking events for massive scientific literature researchThe Electronic Library10.1108/EL-09-2016-019835:4(724-744)Online publication date: 7-Aug-2017
https://dl.acm.org/doi/10.1108/EL-09-2016-0198
Lucarella D(2016)A document retrieval system based on nearest neighbour searchingJournal of Information Science10.1177/01655515880140010414:1(25-33)Online publication date: Jul-2016
https://doi.org/10.1177/016555158801400104
Guan RShi XMarchese MYang CLiang Y(2011)Text Clustering with Seeds Affinity PropagationIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2010.14423:4(627-637)Online publication date: 1-Apr-2011
https://dl.acm.org/doi/10.1109/TKDE.2010.144
Altingovde IDemir ECan FUlusoy Ö(2008)Incremental cluster-based retrieval using compressed cluster-skipping inverted filesACM Transactions on Information Systems10.1145/1361684.136168826:3(1-36)Online publication date: 20-Jun-2008
https://dl.acm.org/doi/10.1145/1361684.1361688
Zobel JMoffat A(2006)Inverted files for text search enginesACM Computing Surveys10.1145/1132956.113295938:2(6-es)Online publication date: 25-Jul-2006
https://dl.acm.org/doi/10.1145/1132956.1132959
Chakrabarti DFaloutsos C(2006)Graph miningACM Computing Surveys10.1145/1132952.113295438:1(2-es)Online publication date: 29-Jun-2006
https://dl.acm.org/doi/10.1145/1132952.1132954
Saito YShapiro M(2005)Optimistic replicationACM Computing Surveys10.1145/1057977.105798037:1(42-81)Online publication date: 1-Mar-2005
https://dl.acm.org/doi/10.1145/1057977.1057980
Gallivan MTruex DKvasny L(2004)Changing patterns in IT skill sets 1988-2003ACM SIGMIS Database: the DATABASE for Advances in Information Systems10.1145/1017114.101712135:3(64-87)Online publication date: 24-Aug-2004
https://dl.acm.org/doi/10.1145/1017114.1017121
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

The Efficiency of Inverted Index and Cluster Searches

Inverted index maintenance strategy for flashSSDs

Cluster validity index: Comparative study and a new validity index with high performance