Sciweavers

813 search results - page 86 / 163
» Efficient Processing of Updates in Dynamic XML Data
Sort
View
VLDB
2002
ACM
108views Database» more  VLDB 2002»
13 years 8 months ago
Adaptive Index Structures
Traditional indexes aim at optimizing the node accesses during query processing, which, however, does not necessarily minimize the total cost due to the possibly large number of r...
Yufei Tao, Dimitris Papadias
TCSV
2008
129views more  TCSV 2008»
13 years 9 months ago
Efficient Architecture Design of Motion-Compensated Temporal Filtering/Motion Compensated Prediction Engine
Since motion-compensated temporal filtering (MCTF) becomes an important temporal prediction scheme in video coding algorithms, this paper presents an efficient temporal prediction ...
Yi-Hau Chen, Chih-Chi Cheng, Tzu-Der Chuang, Ching...
SIGMOD
2004
ACM
164views Database» more  SIGMOD 2004»
14 years 9 months ago
Dynamic Plan Migration for Continuous Queries Over Data Streams
Dynamic plan migration is concerned with the on-the-fly transition from one continuous query plan to a semantically equivalent yet more efficient plan. Migration is important for ...
Yali Zhu, Elke A. Rundensteiner, George T. Heinema...
PPOPP
2010
ACM
14 years 6 months ago
Scalable communication protocols for dynamic sparse data exchange
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
Torsten Hoefler, Christian Siebert, Andrew Lumsdai...
SBBD
2004
89views Database» more  SBBD 2004»
13 years 10 months ago
DBM-Tree: A Dynamic Metric Access Method Sensitive to Local Density Data
Metric Access Methods (MAM) are employed to accelerate the processing of similarity queries, such as the range and the k-nearest neighbor queries. Current methods improve the quer...
Marcos R. Vieira, Caetano Traina Jr., Fabio Jun Ta...