Sciweavers

329 search results - page 60 / 66
» Efficient Processing of Multiple XML Twig Queries
Sort
View
VLDB
2008
ACM
178views Database» more  VLDB 2008»
14 years 7 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
WAIM
2007
Springer
14 years 1 months ago
Distributed, Hierarchical Clustering and Summarization in Sensor Networks
We propose DHCS, a method of distributed, hierarchical clustering and summarization for online data analysis and mining in sensor networks. Different from the acquisition and aggre...
Xiuli Ma, Shuangfeng Li, Qiong Luo, Dongqing Yang,...
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
13 years 12 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
SAC
2008
ACM
13 years 7 months ago
Continuous k-dominant skyline computation on multidimensional data streams
Skyline queries are important due to their usefulness in many application domains. However, by increasing the number of attributes, the probability that a tuple dominates another ...
Maria Kontaki, Apostolos N. Papadopoulos, Yannis M...
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
14 years 7 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes