Sciweavers

1160 search results - page 70 / 232
» Query Processing and Optimization for Pictorial Query Trees
Sort
View
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 17 days ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
97
Voted
ICDE
2011
IEEE
238views Database» more  ICDE 2011»
14 years 1 months ago
Join queries on uncertain data: Semantics and efficient processing
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
Tingjian Ge
101
Voted
KIVS
2009
Springer
15 years 4 months ago
Query Processing and System-Level Support for Runtime-Adaptive Sensor Networks
We present an integrated approach for supporting in-network sensor data processing in dynamic and heterogeneous sensor networks. The concept relies on data stream processing techni...
Falko Dressler, Rüdiger Kapitza, Michael Daum...
SIGMETRICS
2011
ACM
208views Hardware» more  SIGMETRICS 2011»
14 years 28 days ago
Structure-aware sampling on data streams
The massive data streams observed in network monitoring, data processing and scientific studies are typically too large to store. For many applications over such data, we must ob...
Edith Cohen, Graham Cormode, Nick G. Duffield
103
Voted
DATESO
2008
131views Database» more  DATESO 2008»
14 years 11 months ago
Towards Cost-based Optimizations of Twig Content-based Queries
Abstract In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for t...
Michal Krátký, Radim Baca