Sciweavers

643 search results - page 42 / 129
» Dynamic prioritization of database queries
Sort
View
PDIS
1993
IEEE
15 years 1 months ago
The Kendall Square Query Decomposer
d Abstract:: ACM SIGMOD Record 22 (4), Dec. 1993) RM93 Rahm, E., Marek, R.: Analysis of Dynamic Load Balancing Strategies for Parallel Shared Nothing Database Systems. Proc 19th VL...
David S. Reiner
SISAP
2009
IEEE
159views Data Mining» more  SISAP 2009»
15 years 4 months ago
Dynamic P2P Indexing and Search Based on Compact Clustering
Abstract—We propose a strategy to perform query processing on P2P similarity search systems based on peers and superpeers. We show that by approximating global but resumed inform...
Mauricio Marín, Veronica Gil Costa, Cecilia...
ADBIS
2006
Springer
182views Database» more  ADBIS 2006»
15 years 3 months ago
A Middleware-Based Approach to Database Caching
Database caching supports declarative query processing close to the application. Using a full-fledged DBMS as cache manager, it enables the evaluation of specific project-select-...
Andreas Bühmann, Theo Härder, Christian ...
EDBT
2006
ACM
191views Database» more  EDBT 2006»
15 years 10 months ago
Parallelizing Skyline Queries for Scalable Distribution
Skyline queries help users make intelligent decisions over complex data, where different and often conflicting criteria are considered. Current skyline computation methods are rest...
Ping Wu, Caijie Zhang, Ying Feng, Ben Y. Zhao, Div...
EDBT
2009
ACM
113views Database» more  EDBT 2009»
15 years 4 months ago
Query ranking in probabilistic XML data
Twig queries have been extensively studied as a major fragment of XPATH queries to query XML data. In this paper, we study PXMLRANK query, (Q, k), which is to rank top-k probabili...
Lijun Chang, Jeffrey Xu Yu, Lu Qin