Sciweavers

2514 search results - page 134 / 503
» On the Computation of Approximations of Database Queries
Sort
View
EDBT
2006
ACM
174views Database» more  EDBT 2006»
16 years 6 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
EDBT
2008
ACM
128views Database» more  EDBT 2008»
16 years 6 months ago
Processing transitive nearest-neighbor queries in multi-channel access environments
Wireless broadcast is an efficient way for information dissemination due to its good scalability [10]. Existing works typically assume mobile devices, such as cell phones and PDAs...
Xiao Zhang, Wang-Chien Lee, Prasenjit Mitra, Baihu...
ICDE
2006
IEEE
138views Database» more  ICDE 2006»
16 years 7 months ago
SUBSKY: Efficient Computation of Skylines in Subspaces
Given a set of multi-dimensional points, the skyline contains the best points according to any preference function that is monotone on all axes. In practice, applications that req...
Yufei Tao, Xiaokui Xiao, Jian Pei
EDBT
2004
ACM
174views Database» more  EDBT 2004»
16 years 6 months ago
Processing Data-Stream Join Aggregates Using Skimmed Sketches
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
ICDE
2006
IEEE
152views Database» more  ICDE 2006»
16 years 15 days ago
Redundancy Awareness in SQL Queries
In this paper, we study SQL queries with aggregate subqueries that share common tables and conditions with the outer query. While several approaches can deal with such queries, th...
Bin Cao, Antonio Badia