Sciweavers

1160 search results - page 45 / 232
» Query Processing and Optimization for Pictorial Query Trees
Sort
View
VLDB
2003
ACM
141views Database» more  VLDB 2003»
15 years 10 months ago
Computing complete answers to queries in the presence of limited access patterns
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
Chen Li
MOBIDE
2010
ACM
14 years 10 months ago
Minimum-hot-spot query trees for wireless sensor networks
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...
Georgios Chatzimilioudis, Demetrios Zeinalipour-Ya...
SIGMOD
1995
ACM
80views Database» more  SIGMOD 1995»
15 years 1 months ago
Join Queries with External Text Sources: Execution and Optimization Techniques
Text is a pervasive information type, and many applications require querying over text sources in addition to structured data. This paper studies the problem of query processing i...
Surajit Chaudhuri, Umeshwar Dayal, Tak W. Yan
ICDE
2006
IEEE
147views Database» more  ICDE 2006»
15 years 4 months ago
Optimizing Multiple Queries in Distributed Data Stream Systems
We consider the problem of query optimization in distributed stream based systems where multiple continuous queries may be executing simultaneously. In such systems, distribution ...
Sangeetha Seshadri, Vibhore Kumar, Brian F. Cooper
DAWAK
2003
Springer
15 years 3 months ago
Computing SQL Queries with Boolean Aggregates
We introduce a new method for optimization of SQL queries with nested subqueries. The method is based on the idea of Boolean aggregates, aggregates that compute the conjunction or ...
Antonio Badia