Sciweavers

9683 search results - page 96 / 1937
» Query performance prediction
Sort
View
VLDB
2005
ACM
93views Database» more  VLDB 2005»
14 years 2 months ago
The TEXTURE Benchmark: Measuring Performance of Text Queries on a Relational DBMS
We introduce a benchmark called TEXTURE (TEXT Under RElations) to measure the relative strengths and weaknesses of combining text processing with a relational workload in an RDBMS...
Vuk Ercegovac, David J. DeWitt, Raghu Ramakrishnan
ISCI
2007
141views more  ISCI 2007»
13 years 9 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...
DL
1998
Springer
111views Digital Library» more  DL 1998»
14 years 1 months ago
Query Performance for Tightly Coupled Distributed Digital Libraries
We consider a digital library distributed in a tightly coupled environment. The library is indexed by inverted files and the vector space model is used as ranking strategy. Using ...
Berthier A. Ribeiro-Neto, Ramurti A. Barbosa
NSDI
2004
13 years 10 months ago
Beehive: O(1) Lookup Performance for Power-Law Query Distributions in Peer-to-Peer Overlays
Structured peer-to-peer hash tables provide decentralization, self-organization, failure-resilience, and good worst-case lookup performance for applications, but suffer from high ...
Venugopalan Ramasubramanian, Emin Gün Sirer
EURONGI
2008
Springer
13 years 11 months ago
Performance Evaluation of Overlay-Based Range Queries in Mobile Systems
Current mobility management systems are operator centralized, and focused on single link technologies. In heterogeneous wireless mesh networks, vertical handovers could be a length...
Amine M. Houyou, Alexander Stenzer, Hermann de Mee...