Sciweavers

806 search results - page 3 / 162
» An Optimal Dynamic Data Structure for Stabbing-Semigroup Que...
Sort
View
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
13 years 6 months ago
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
Guy E. Blelloch
DBISP2P
2003
Springer
105views Database» more  DBISP2P 2003»
13 years 10 months ago
Distributed Queries and Query Optimization in Schema-Based P2P-Systems
Databases have employed a schema-based approach to store and retrieve structured data for decades. For peer-to-peer (P2P) networks, similar approaches are just beginning to emerge,...
Ingo Brunkhorst, Hadhami Dhraief, Alfons Kemper, W...
WWW
2007
ACM
14 years 6 months ago
Optimized query planning of continuous aggregation queries in dynamic data dissemination networks
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Krithi Ramamritham
ICDE
2003
IEEE
155views Database» more  ICDE 2003»
14 years 6 months ago
XR-Tree: Indexing XML Data for Efficient Structural Joins
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
Haifeng Jiang, Hongjun Lu, Wei Wang 0011, Beng Chi...
EDBT
1998
ACM
155views Database» more  EDBT 1998»
13 years 9 months ago
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations
Abstract. In this paper, we propose a new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems. Since it is ver...
Stefan Berchtold, Christian Böhm, Hans-Peter ...