Home
Catalogue search
Refine your search:
Keyword:
Data Storage Representations (2)
Experimentation (2)
Measurement (2)
Performance (2)
Data Compression (1)
I.7.3 [Document and Text Processing (1)
Language Indepen- dent Text Indexing (1)
Text Compression (1)
Text Processing—index generation Keywords Text Indexing (1)
query formulation (1)
more
Creator / Publisher:
Falk Scholer (2)
The Pennsylvania State University CiteSeerX Archives (2)
Matthias Petri (1)
Michiko Yasukawa (1)
Year
Medium
Type:
Article (2)
BLLDB-Access
Search in the Catalogues and Directories
All fields
Title
Creator / Publisher
Keyword
Year
AND
OR
AND NOT
All fields
Title
Creator / Publisher
Keyword
Year
AND
OR
AND NOT
All fields
Title
Creator / Publisher
Keyword
Year
AND
OR
AND NOT
All fields
Title
Creator / Publisher
Keyword
Year
AND
OR
AND NOT
All fields
Title
Creator / Publisher
Keyword
Year
Sort by
creator [A → Z]
'
creator [Z → A]
'
publishing year ↑ (asc)
'
publishing year ↓ (desc)
'
title [A → Z]
'
title [Z → A]
'
Simple Search
Hits 1 – 2 of 2
1
Efficient in-memory top-k document retrieval
Matthias Petri
;
Falk Scholer
In: http://goanna.cs.rmit.edu.au/~e76763/publications/cps12-sigir.pdf (2012)
Abstract:
For over forty years the dominant data structure for ranked document retrieval has been the inverted index. Inverted indexes are effective for a variety of document retrieval tasks, and particularly efficient for large data collection scenarios that require disk access and storage. However, many efficiency-bound search tasks can now easily be supported entirely in-memory as a result of recent hardware advances. In this paper we present a hybrid algorithmic framework for inmemory bag-of-words ranked document retrieval using a self-index derived from the FM-Index, wavelet tree, and the compressed suffix tree data structures, and evaluate the various algorithmic trade-offs for performing efficient queries entirely in-memory. We compare our approach with two classic approaches to bag-of-words queries using inverted indexes, term-at-a-time (TAAT) and document-at-atime (DAAT) query processing. We show that our framework is competitive with state-of-the-art indexing structures, and describe new capabilities provided by our algorithms that can be leveraged by future systems to improve effectiveness and efficiency for a variety of fundamental search operations.
Keyword:
Data Storage Representations
;
Experimentation
;
I.7.3 [Document and Text Processing
;
Measurement
;
Performance
;
query formulation
;
retrieval models
;
search process
;
Text Compression
;
Text Processing—index generation Keywords Text Indexing
URL:
http://goanna.cs.rmit.edu.au/~e76763/publications/cps12-sigir.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.415.5098
BASE
Hide details
2
Language independent ranked retrieval with NeWT
Michiko Yasukawa
;
Falk Scholer
In: http://goanna.cs.rmit.edu.au/~e76763/publications/cys11-adcs.pdf (2011)
BASE
Show details
Mobile view
All
Catalogues
UB Frankfurt Linguistik
0
IDS Mannheim
0
OLC Linguistik
0
UB Frankfurt Retrokatalog
0
DNB Subject Category Language
0
Institut für Empirische Sprachwissenschaft
0
Leibniz-Centre General Linguistics (ZAS)
0
Bibliographies
BLLDB
0
BDSL
0
IDS Bibliografie zur deutschen Grammatik
0
IDS Bibliografie zur Gesprächsforschung
0
IDS Konnektoren im Deutschen
0
IDS Präpositionen im Deutschen
0
IDS OBELEX meta
0
MPI-SHH Linguistics Collection
0
MPI for Psycholinguistics
0
Linked Open Data catalogues
Annohub
0
Online resources
Link directory
0
Journal directory
0
Database directory
0
Dictionary directory
0
Open access documents
BASE
2
Linguistik-Repository
0
IDS Publikationsserver
0
Online dissertations
0
Language Description Heritage
0
© 2013 - 2024 Lin|gu|is|tik
|
Imprint
|
Privacy Policy
|
Datenschutzeinstellungen ändern