Sciweavers

651 search results - page 48 / 131
» Algebraic Query Optimization for Distributed Top-k Queries
Sort
View
ICDE
2007
IEEE
120views Database» more  ICDE 2007»
14 years 3 months ago
Optimizing State-Intensive Non-Blocking Queries Using Run-time Adaptation
Main memory is a critical resource when processing non-blocking queries with state intensive operators that require real-time responses. While partitioned parallel processing can ...
Bin Liu, Mariana Jbantova, Elke A. Rundensteiner
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
13 years 10 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
ICDCS
1999
IEEE
14 years 1 months ago
Run-time Detection in Parallel and Distributed Systems: Application to Safety-Critical Systems
There is growing interest in run-time detection as parallel and distributed systems grow larger and more complex. This work targets run-time analysis of complex, interactive scien...
Beth Plale, Karsten Schwan
SIGMOD
2000
ACM
121views Database» more  SIGMOD 2000»
14 years 1 months ago
MOCHA: A Self-Extensible Database Middleware System for Distributed Data Sources
We present MOCHA, a new self-extensible database middleware system designed to interconnect distributed data sources. MOCHA is designed to scale to large environments and is based...
Manuel Rodriguez-Martinez, Nick Roussopoulos
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
14 years 9 months ago
A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
Frederick Reiss, Tapas Kanungo