Inverted files for text search engines
ACM Computing Surveys (CSUR)
Query-driven document partitioning and collection selection
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Load balancing for term-distributed parallel retrieval
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Analyzing imbalance among homogeneous index servers in a web search system
Information Processing and Management: an International Journal
Efficient in-memory extensible inverted file
Information Systems
A pipelined architecture for distributed text query evaluation
Information Retrieval
High-performance distributed inverted files
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Toward a multi-tier index for information retrieval system
SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
Load-balancing and caching for collection selection architectures
Proceedings of the 2nd international conference on Scalable information systems
Toward a multi-tier index for information retrieval system
TELE-INFO'05 Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics
Two-Dimensional Distributed Inverted Files
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Load and storage balanced posting file partitioning for parallel information retrieval
Journal of Systems and Software
On-line multi-threaded processing of web user-clicks on multi-core processors
VECPAR'10 Proceedings of the 9th international conference on High performance computing for computational science
Toward a multi-tier index for information retrieval system
ICAI'05/MCBC'05/AMTA'05/MCBE'05 Proceedings of the 6th WSEAS international conference on Automation & information, and 6th WSEAS international conference on mathematics and computers in biology and chemistry, and 6th WSEAS international conference on acoustics and music: theory and applications, and 6th WSEAS international conference on Mathematics and computers in business and economics
A combined semi-pipelined query processing architecture for distributed full-text retrieval
WISE'10 Proceedings of the 11th international conference on Web information systems engineering
An evaluation of fault-tolerant query processing for web search engines
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
Assigning documents to master sites in distributed search
Proceedings of the 20th ACM international conference on Information and knowledge management
Replicated partitioning for undirected hypergraphs
Journal of Parallel and Distributed Computing
Fast concurrency control for distributed inverted files
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
Scalable search platform: improving pipelined query processing for distributed full-text retrieval
Proceedings of the 21st international conference companion on World Wide Web
A search engine accepting on-line updates
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
(Sync|Async)+ MPI search engines
PVM/MPI'07 Proceedings of the 14th European conference on Recent Advances in Parallel Virtual Machine and Message Passing Interface
A term-based inverted index partitioning model for efficient distributed query processing
ACM Transactions on the Web (TWEB)
Modelling Search Engines Performance Using Coloured Petri Nets
Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012
| Hi-index | 0.00 |
Examines the searching of partitioned inverted files with particular emphasis on issues that arise from different types of partitioning methods. Two types of index partitions are investigated, namely term identifier (TermId) partitioning and document identifier (DocId) partitioning. We describe the search operations implemented in order to support parallelism in probabilistic searching. We also describe higher-level features, such as search topologies, in parallel search methods. The results from runs on the two types of partitioning are compared and contrasted. We conclude that, within our framework, the DocId method is the best.