Sciweavers

806 search results - page 39 / 162
» An Optimal Dynamic Data Structure for Stabbing-Semigroup Que...
Sort
View
JGTOOLS
2008
100views more  JGTOOLS 2008»
13 years 7 months ago
Proximity Cluster Trees
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...
Elena Jakubiak Hutchinson, Sarah F. Frisken, Ronal...
VLDB
2007
ACM
145views Database» more  VLDB 2007»
14 years 8 months ago
LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
Shirish Tatikonda, Srinivasan Parthasarathy, Matth...
COMAD
2008
13 years 9 months ago
Runtime Optimization of Continuous Queries
In data stream processing systems, Quality of Service (or QoS) requirements, as specified by users, are extremely important. Unlike in a database management system (DBMS), a query...
Balakumar Kendai, Sharma Chakravarthy
SIGMOD
1999
ACM
127views Database» more  SIGMOD 1999»
13 years 12 months ago
An Adaptive Query Execution System for Data Integration
Query processing in data integration occurs over network-bound, autonomous data sources. This requires extensions to traditional optimization and execution techniques for three re...
Zachary G. Ives, Daniela Florescu, Marc Friedman, ...
ADL
2000
Springer
251views Digital Library» more  ADL 2000»
14 years 1 days ago
Efficient Similarity Search in Digital Libraries
Digital libraries are a core information technology. When the stored data is complex, e.g. high-resolution images or molecular protein structures, simple query types like the exac...
Christian Böhm, Bernhard Braunmüller, Ha...