Sciweavers

81 search results - page 3 / 17
» Optimal Multidimensional Query Processing Using Tree Stripin...
Sort
View
ICDCS
2009
IEEE
14 years 2 months ago
m-LIGHT: Indexing Multi-Dimensional Data over DHTs
In this paper, we study the problem of indexing multidimensional data in the P2P networks based on distributed hash tables (DHTs). We identify several design issues and propose a ...
Yuzhe Tang, Jianliang Xu, Shuigeng Zhou, Wang-Chie...
ICDE
2009
IEEE
182views Database» more  ICDE 2009»
14 years 6 months ago
Adaptive Parallelization of Queries over Dependent Web Service Calls
We have developed a system to process database queries over composed data providing web services. The queries are transformed into execution plans containing an operator that invok...
Manivasakan Sabesan, Tore Risch
VLDB
1997
ACM
120views Database» more  VLDB 1997»
13 years 9 months ago
A Region Splitting Strategy for Physical Database Design of Multidimensional File Organizations
This paper presents a region splitting strategy for physical database design of multidimensional le organizations. Physical database design is the process of determining the optim...
Jong-Hak Lee, Young-Koo Lee, Kyu-Young Whang, Il-Y...
IS
2011
12 years 11 months ago
Optimized query routing trees for wireless sensor networks
In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with ...
Panayiotis Andreou, Demetrios Zeinalipour-Yazti, A...
VLDB
2008
ACM
178views Database» more  VLDB 2008»
14 years 5 months ago
The Bdual-Tree: indexing moving objects by space filling curves in the dual space
Abstract Existing spatiotemporal indexes suffer from either large update cost or poor query performance, except for the Bx -tree (the state-of-the-art), which consists of multiple ...
Man Lung Yiu, Yufei Tao, Nikos Mamoulis