Sciweavers

139 search results - page 9 / 28
» Compression of inverted indexes for fast query evaluation
Sort
View
VLDB
2003
ACM
107views Database» more  VLDB 2003»
14 years 10 months ago
A performance study of four index structures for set-valued attributes of low cardinality
The efficient retrieval of data items on set-valued attributes is an important research topic that has attracted little attention so far. We studied and modified four index structu...
Sven Helmer, Guido Moerkotte
SIGIR
2011
ACM
13 years 19 days ago
Faster temporal range queries over versioned text
Versioned textual collections are collections that retain multiple versions of a document as it evolves over time. Important large-scale examples are Wikipedia and the web collect...
Jinru He, Torsten Suel
SYRCODIS
2007
92views Database» more  SYRCODIS 2007»
13 years 11 months ago
A Method for Evaluating Full-text Search Queries in Native XML Databases
In this paper we consider the problem of efficiently producing results for full-text keyword search queries over XML documents. We describe full-text search query semantics and pr...
Roman Pastukhov
ERCIMDL
2009
Springer
167views Education» more  ERCIMDL 2009»
14 years 4 months ago
A Compressed Self-indexed Representation of XML Documents
This paper presents a structure we call XML Wavelet Tree (XWT) to represent any XML document in a compressed and self-indexed form. Therefore, any query or procedure that could be ...
Nieves R. Brisaboa, Ana Cerdeira-Pena, Gonzalo Nav...
WWW
2005
ACM
14 years 10 months ago
A fast XPATH evaluation technique with the facility of updates
This paper addresses the problem of fast retrieval of data from XML documents by providing a labeling schema that can easily handle simple as well as complex XPATH queries and als...
Ashish Virmani, Suchit Agarwal, Rahul Thathoo, She...