Sciweavers

2092 search results - page 160 / 419
» Dynamically Distributed Query Evaluation
Sort
View
VLDB
2004
ACM
161views Database» more  VLDB 2004»
16 years 3 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
VLDB
1995
ACM
97views Database» more  VLDB 1995»
15 years 6 months ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch
VLDB
1999
ACM
133views Database» more  VLDB 1999»
15 years 7 months ago
Online Dynamic Reordering for Interactive Data Processing
We present a pipelining, dynamically usercontrollable reorder operator, for use in dataintensive applications. Allowing the user to reorder the data delivery on the fly increases...
Vijayshankar Raman, Bhaskaran Raman, Joseph M. Hel...
CASES
2004
ACM
15 years 7 months ago
Reducing energy consumption of queries in memory-resident database systems
The tremendous growth of system memories has increased the capacities and capabilities of memory-resident embedded databases, yet current embedded databases need to be tuned in or...
Jayaprakash Pisharath, Alok N. Choudhary, Mahmut T...
IPPS
2007
IEEE
15 years 9 months ago
Measuring the Robustness of Resource Allocations in a Stochastic Dynamic Environment
Heterogeneous distributed computing systems often must operate in an environment where system parameters are subject to uncertainty. Robustness can be defined as the degree to wh...
Jay Smith, Luis Diego Briceno, Anthony A. Maciejew...