Sciweavers

9683 search results - page 93 / 1937
» Query performance prediction
Sort
View
VLDB
2000
ACM
129views Database» more  VLDB 2000»
14 years 24 days ago
Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data
Strict consistency of replicated data is infeasible or not required by many distributed applications, so current systems often permit stale replication, in which cached copies of ...
Chris Olston, Jennifer Widom
DOCENG
2008
ACM
13 years 11 months ago
Improving query performance on XML documents: a workload-driven design approach
As XML has emerged as a data representation format and as great quantities of data have been stored in the XML format, XML document design has become an important and evident issu...
Rebeca Schroeder, Ronaldo dos Santos Mello
ITCC
2002
IEEE
14 years 2 months ago
Performance of KDB-Trees with Query-Based Splitting
While the persistent data of many advanced database applications, such as OLAP and scientific studies, are characterized by very high dimensionality, typical queries posed on thes...
Yves Lépouchard, John L. Pfaltz, Ratko Orla...
IPM
2006
75views more  IPM 2006»
13 years 9 months ago
Performance of query processing implementations in ranking-based text retrieval systems using inverted indices
Similarity calculations and document ranking form the computationally expensive parts of query processing in ranking-based text retrieval. In this work, for these calculations, 11...
Berkant Barla Cambazoglu, Cevdet Aykanat
BNCOD
2004
184views Database» more  BNCOD 2004»
13 years 10 months ago
Bulk Loading the M-Tree to Enhance Query Performance
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
Alan P. Sexton, Richard Swinbank