Sciweavers

1160 search results - page 13 / 232
» Query Processing and Optimization for Pictorial Query Trees
Sort
View
SIAMCOMP
2012
12 years 1 months ago
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
Let S be a set of n intervals in R, and let (S, +) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the se...
Pankaj K. Agarwal, Lars Arge, Haim Kaplan, Eyal Mo...
IS
2011
13 years 2 months ago
Collection trees for event-monitoring queries
In this paper we present algorithms for building and maintaining efficient collection trees that provide the conduit to disseminate data required for processing monitoring queries...
Antonios Deligiannakis, Yannis Kotidis, Vassilis S...
MDM
2004
Springer
138views Communications» more  MDM 2004»
14 years 4 months ago
Optimizing Data Placement over Wireless Broadcast Channel for Multi-Dimensional Range Query Processing
Data broadcasting is well known for its excellent scalability. Multi-dimensional range queries, such as spatial range queries of geographical information for location dependent se...
Jianting Zhang, Le Gruenwald
ICDE
2003
IEEE
161views Database» more  ICDE 2003»
15 years 8 days ago
Structural Join Order Selection for XML Query Optimization
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...
Yuqing Wu, Jignesh M. Patel, H. V. Jagadish
WEBDB
2009
Springer
112views Database» more  WEBDB 2009»
14 years 5 months ago
Querying DAG-shaped Execution Traces Through Views
The question whether a given set of views, defined by queries, can be used to answer another query, arises in several contexts such as query optimization, data integration and se...
Maya Ben-Ari, Tova Milo, Elad Verbin