Sciweavers

902 search results - page 17 / 181
» Efficient and Extensible Algorithms for Multi Query Optimiza...
Sort
View
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
14 years 9 months ago
Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum
ICC
2007
IEEE
200views Communications» more  ICC 2007»
14 years 2 months ago
Optimal Packet Scheduling for Multi-Description Multi-Path Video Streaming Over Wireless Networks
—As developments in wireless networks continue, there is an increasing expectation with regard to supporting highquality real-time video streaming service in such networks. The r...
Gui Xie, M. N. S. Swamy, M. Omair Ahmad
PVLDB
2008
108views more  PVLDB 2008»
13 years 8 months ago
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...
FUIN
2006
139views more  FUIN 2006»
13 years 8 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
ICDE
1995
IEEE
112views Database» more  ICDE 1995»
14 years 9 months ago
Optimizing Queries with Materialized Views
While much work has addressed the problem of maintaining materialized views, the important question of optimizing queries in the presence of materialized views has not been resolv...
Surajit Chaudhuri, Ravi Krishnamurthy, Spyros Pota...