Sciweavers

958 search results - page 145 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
PVLDB
2008
126views more  PVLDB 2008»
14 years 9 months ago
Parallelizing query optimization
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
Wook-Shin Han, Wooseong Kwak, Jinsoo Lee, Guy M. L...
ICDE
2008
IEEE
232views Database» more  ICDE 2008»
15 years 11 months ago
Continuous Content-Based Copy Detection over Streaming Videos
Digital videos are increasingly adopted in various multimedia applications where they are usually broadcasted or transmitted as video streams. Continuously monitoring copies on the...
Ying Yan, Beng Chin Ooi, Aoying Zhou
TIP
2010
90views more  TIP 2010»
14 years 4 months ago
Fast Query for Exemplar-Based Image Completion
In this paper, we present a fast algorithm for filling unknown regions in an image using the strategy of exemplarmatching. Unlike the original exemplar-based method using exhaustiv...
Tsz-Ho Kwok, Hoi Sheung, Charlie C. L. Wang
115
Voted
EDBT
1992
ACM
111views Database» more  EDBT 1992»
15 years 1 months ago
Pipelined Query Processing in the DBGraph Storage Model
The DBGraph storage model, designed for main memory DBMS, ensures both data storage compactness and efficient processing for all database operations. By representing the entire da...
Philippe Pucheral, Jean-Marc Thévenin
ISAAC
2010
Springer
308views Algorithms» more  ISAAC 2010»
14 years 7 months ago
Levelwise Mesh Sparsification for Shortest Path Queries
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo