Sciweavers

1429 search results - page 69 / 286
» Efficient processing of XPath queries using indexes
Sort
View
SIGMOD
2007
ACM
187views Database» more  SIGMOD 2007»
14 years 9 months ago
P-ring: an efficient and robust P2P range index structure
Data availability, collection and storage have increased dramatically in recent years, raising new technological and algorithmic challenges for database design and data management...
Adina Crainiceanu, Prakash Linga, Ashwin Machanava...
SIGIR
2012
ACM
11 years 11 months ago
Optimizing positional index structures for versioned document collections
Versioned document collections are collections that contain multiple versions of each document. Important examples are Web archives, Wikipedia and other wikis, or source code and ...
Jinru He, Torsten Suel
ICDE
2009
IEEE
163views Database» more  ICDE 2009»
14 years 10 months ago
A Data Structure for Sponsored Search
Abstract-- Inverted files have been very successful for document retrieval, but sponsored search is different. Inverted files are designed to find documents that match the query (a...
Arnd Christian König, Kenneth Ward Church, Ma...
VLDB
2007
ACM
145views Database» more  VLDB 2007»
14 years 9 months ago
LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
Shirish Tatikonda, Srinivasan Parthasarathy, Matth...
TC
2010
13 years 7 months ago
TSS: Efficient Term Set Search in Large Peer-to-Peer Textual Collections
—Previous multikeyword search in DHT-based P2P systems often relies on multiple single keyword search operations, suffering from unacceptable traffic cost and poor accuracy. Prec...
Hanhua Chen, Jun Yan, Hai Jin, Yunhao Liu, Lionel ...