Sciweavers

320 search results - page 40 / 64
» A New Compression Method with Fast Searching on Large Databa...
Sort
View
SIGMOD
2003
ACM
111views Database» more  SIGMOD 2003»
14 years 8 months ago
Extended Wavelets for Multiple Measures
While work in recent years has demonstrated that wavelets can be efficiently used to compress large quantities of data and provide fast and fairly accurate answers to queries, lit...
Antonios Deligiannakis, Nick Roussopoulos
EDBT
2004
ACM
145views Database» more  EDBT 2004»
14 years 8 months ago
CUBE File: A File Structure for Hierarchically Clustered OLAP Cubes
Abstract. Hierarchical clustering has been proved an effective means for physically organizing large fact tables since it reduces significantly the I/O cost during ad hoc OLAP quer...
Nikos Karayannidis, Timos K. Sellis, Yannis Kouvar...
CVDB
2004
ACM
14 years 1 months ago
Nearest Neighbor Search on Multimedia Indexing Structures
Nearest Neighbor Search on Multimedia Indexing Structures Multimedia databases get larger and larger in our days, and this trend is expected to continue in the future. There are v...
Thomas Seidl
ISCI
2007
141views more  ISCI 2007»
13 years 8 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...
TOG
2010
181views more  TOG 2010»
13 years 3 months ago
Context-based search for 3D models
Large corpora of 3D models, such as Google 3D Warehouse, are now becoming available on the web. It is possible to search these databases using a keyword search. This makes it poss...
Matthew Fisher, Pat Hanrahan