Sciweavers

1567 search results - page 20 / 314
» Compressing Relations and Indexes
Sort
View
JCDL
2010
ACM
156views Education» more  JCDL 2010»
13 years 8 months ago
Interactively browsing movies in terms of action, foreshadowing and resolution
We describe a novel video player that uses Temporal Semantic Compression (TSC) to present a compressed summary of a movie. Compression is based on tempo which is derived from film...
Stewart Greenhill, Brett Adams, Svetha Venkatesh
ICASSP
2009
IEEE
14 years 2 months ago
Comparison of MPEG-7 descriptors for long term selection of reference frames
During the last years, the amount of multimedia content has greatly increased. This has multiplied the need of efficient compression of the content but also the ability to search...
Javier Ruiz Hidalgo, Philippe Salembier
BTW
2003
Springer
94views Database» more  BTW 2003»
14 years 29 days ago
The Paradigm of Relational Indexing: a Survey
Abstract: In order to achieve efficient execution plans for queries comprising userdefined data types and predicates, the database system has to be provided with appropriate index ...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
ICDE
2010
IEEE
180views Database» more  ICDE 2010»
13 years 8 months ago
Adaptive indexing for relational keys
: © Adaptive indexing for relational keys Goetz Graefe, Harumi Kuno HP Laboratories HPL-2010-23 databases, indexes, storage systems, B-trees, adaptive merging, database cracking A...
Goetz Graefe, Harumi A. Kuno
DATESO
2009
158views Database» more  DATESO 2009»
13 years 5 months ago
Benchmarking Coding Algorithms for the R-tree Compression
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications i...
Jirí Walder, Michal Krátký, R...