Data

Codebase for Early Termination Heuristics for Score-at-a-Time Index Traversal

RMIT University, Australia
Professor Shane Culpepper (Aggregated by) Shane Culpepper (Aggregated by)
Viewed: [[ro.stat.viewed]] Cited: [[ro.stat.cited]] Accessed: [[ro.stat.accessed]]
ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rfr_id=info%3Asid%2FANDS&rft_id=https://github.com/rmit-ir/Multi-Jass&rft.title=Codebase for Early Termination Heuristics for Score-at-a-Time Index Traversal&rft.identifier=d5275771c10c721d9b5245be3ac73f77&rft.publisher=RMIT University, Australia&rft.description=This codebase is used in the ADCS 2017 paper Early Termination Heuristics for Score-at-a-Time Index Traversal. You first need to build ATIRE, and then point to the ATIRE directory in the GNUMakefile. The invocation is the same as with the regular Jass program, but you may wish to specify the number of threads to use when building the code. Abstract Score-at-a-Time index traversal is a query processing approach which supports early termination in order to balance efficiency and effectiveness trade-offs. In this work, we explore new techniques which extend a modern Score-at-a-Time traversal algorithm to allow for parallel postings traversal. We show that careful integration of parallel traversal can improve both efficiency and effectiveness when compared with current single threaded early termination approaches. In addition, we explore the various trade-offs for differing early termination heuristics, and propose hybrid systems which parallelize long running queries, while processing short running queries with only a single thread. &rft.creator=Professor Shane Culpepper&rft.creator=Shane Culpepper&rft.date=2018&rft.relation=http://culpepper.io/publications/msc17-adcs.pdf&rft_rights=All Rights Reserved&rft_rights=CC BY-NC: Attribution-Noncommercial 3.0 AU http://creativecommons.org/licenses/by-nc/3.0/au&rft_subject=Query processing&rft_subject=Score-at-a-Time traversal&rft_subject=Early termination heuristics&rft_subject=Information Retrieval and Web Search&rft_subject=INFORMATION AND COMPUTING SCIENCES&rft_subject=LIBRARY AND INFORMATION STUDIES&rft.type=dataset&rft.language=English Access the data

Licence & Rights:

Other view details
Unknown

CC BY-NC: Attribution-Noncommercial 3.0 AU
http://creativecommons.org/licenses/by-nc/3.0/au

All Rights Reserved

Access:

Other view details

Data available in link. For any queries about this or any other RMIT dataset, please contact research.data@rmit.edu.au

Contact Information


GitHub

Full description

This codebase is used in the ADCS 2017 paper "Early Termination Heuristics for Score-at-a-Time Index Traversal". You first need to build ATIRE, and then point to the ATIRE directory in the GNUMakefile. The invocation is the same as with the regular Jass program, but you may wish to specify the number of threads to use when building the code. Abstract Score-at-a-Time index traversal is a query processing approach which supports early termination in order to balance efficiency and effectiveness trade-offs. In this work, we explore new techniques which extend a modern Score-at-a-Time traversal algorithm to allow for parallel postings traversal. We show that careful integration of parallel traversal can improve both efficiency and effectiveness when compared with current single threaded early termination approaches. In addition, we explore the various trade-offs for differing early termination heuristics, and propose hybrid systems which parallelize long running queries, while processing short running queries with only a single thread.

This dataset is part of a larger collection

Click to explore relationships graph
Subjects

User Contributed Tags    

Login to tag this record with meaningful keywords to make it easier to discover

Identifiers
  • Local : d5275771c10c721d9b5245be3ac73f77