Sciweavers

73 search results - page 4 / 15
» Distributed Query Processing Using Partitioned Inverted File...
Sort
View
88
Voted
CIKM
2004
Springer
15 years 2 months ago
Using a compact tree to index and query XML data
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
Qinghua Zou, Shaorong Liu, Wesley W. Chu
VLDB
1994
ACM
148views Database» more  VLDB 1994»
15 years 1 months ago
Fast Incremental Indexing for Full-Text Information Retrieval
Full-text information retrieval systems have traditionally been designed for archival environments. They often provide little or no support for adding new documents to an existing...
Eric W. Brown, James P. Callan, W. Bruce Croft
PDIS
1993
IEEE
15 years 1 months ago
Log-Based Directory Resolution in the Coda File System
semantic knowledge all concurrent partitionedAbstract updates to an object must be treated as conflicting, andOptimistic replication is an important technique for merged manually b...
Puneet Kumar, Mahadev Satyanarayanan
79
Voted
EUROPAR
2004
Springer
15 years 2 months ago
OLAP Query Processing in a Database Cluster
OLAP queries are typically heavy-weight and ad-hoc thus requiring high storage capacity and processing power. In this paper, we address this problem using a database cluster which...
Alexandre A. B. Lima, Marta Mattoso, Patrick Valdu...
177
Voted
SIGIR
2011
ACM
14 years 10 days ago
Faster top-k document retrieval using block-max indexes
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
Shuai Ding, Torsten Suel