Sciweavers

2985 search results - page 27 / 597
» Indexing Distributed Complex Data for Complex Queries
Sort
View
DAGSTUHL
2004
15 years 3 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
196
Voted
VLDB
2007
ACM
126views Database» more  VLDB 2007»
16 years 2 months ago
Querying Complex Structured Databases
Correctly generating a structured query (e.g., an XQuery or a SQL query) requires the user to have a full understanding of the database schema, which can be a daunting task. Alter...
Cong Yu, H. V. Jagadish
DEXAW
2005
IEEE
193views Database» more  DEXAW 2005»
15 years 8 months ago
Adaptive Distributed Indexing for Spatial Queries in Sensor Networks
Sensor networks have opened new horizons and opportunities for a variety of environmental monitoring, surveillance and healthcare applications. One of the major tasks of sensor ne...
Vladimir Dyo, Cecilia Mascolo
DEBS
2008
ACM
15 years 4 months ago
A framework for performance evaluation of complex event processing systems
Several new Complex Event Processing (CEP) engines have been recently released, many of which are intended to be used in performance sensitive scenarios - like fraud detection, tr...
Marcelo R. N. Mendes, Pedro Bizarro, Paulo Marques
BTW
2007
Springer
292views Database» more  BTW 2007»
15 years 6 months ago
Effective and Efficient Indexing for Large Video Databases
Abstract: Content based multimedia retrieval is an important topic in database systems. An emerging and challenging topic in this area is the content based search in video data. A ...
Christian Böhm, Peter Kunath, Alexey Pryakhin...