Sciweavers

2223 search results - page 136 / 445
» Query Optimization in an OODBMS
Sort
View
JC
2007
94views more  JC 2007»
15 years 3 months ago
On the complexity of the multivariate Sturm-Liouville eigenvalue problem
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
A. Papageorgiou
PVLDB
2008
122views more  PVLDB 2008»
15 years 3 months ago
Identifying robust plans through plan diagram reduction
Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices a...
Harish D., Pooja N. Darera, Jayant R. Haritsa
259
Voted
ICDE
2008
IEEE
215views Database» more  ICDE 2008»
16 years 5 months ago
Fast and Simple Relational Processing of Uncertain Data
This paper introduces U-relations, a succinct and purely relational representation system for uncertain databases. U-relations support attribute-level uncertainty using vertical pa...
Lyublena Antova, Thomas Jansen, Christoph Koch, Da...
SIGMOD
2004
ACM
124views Database» more  SIGMOD 2004»
16 years 3 months ago
BLAS: An Efficient XPath Processing System
We present BLAS , a Bi-LAbeling based System, for efficiently processing complex XPath queries over XML data. BLAS uses Plabeling to process queries involving consecutive child ax...
Yi Chen, Susan B. Davidson, Yifeng Zheng
IDEAS
2006
IEEE
180views Database» more  IDEAS 2006»
15 years 9 months ago
SURCH: Distributed Aggregation over Wireless Sensor Networks
In this paper, we present SURCH, a novel decentralized algorithm for efficient processing of queries generated in sensor networks. Unlike existing techniques, SURCH is fully dist...
Xingbo Yu, Sharad Mehrotra, Nalini Venkatasubraman...