Sciweavers

339 search results - page 13 / 68
» Improved Query Performance with Variant Indexes
Sort
View
CVPR
1997
IEEE
16 years 19 hour ago
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
Jeffrey S. Beis, David G. Lowe
SAC
2006
ACM
15 years 4 months ago
Schemes for SR-Tree packing
Modern database applications like geographic information systems, multimedia databases, and digital libraries dealing with huge volumes of high dimensional data, make use of multi...
Jayendra Venkateswaran, S. R. Subramanya
ICASSP
2008
IEEE
15 years 4 months ago
Fast query by example of environmental sounds via robust and efficient cluster-based indexing
There has been much recent progress in the technical infrastructure necessary to continuously characterize and archive all sounds, or more precisely auditory streams, that occur w...
Jiachen Xue, Gordon Wichern, Harvey D. Thornburg, ...
TKDE
2002
148views more  TKDE 2002»
14 years 9 months ago
Parallel Star Join + DataIndexes: Efficient Query Processing in Data Warehouses and OLAP
On-Line Analytical Processing (OLAP) refers to the technologies that allow users to efficiently retrieve data from the data warehouse for decision-support purposes. Data warehouses...
Anindya Datta, Debra E. VanderMeer, Krithi Ramamri...
SIGMOD
2007
ACM
91views Database» more  SIGMOD 2007»
15 years 10 months ago
Indexing dataspaces
Dataspaces are collections of heterogeneous and partially unstructured data. Unlike data-integration systems that also offer uniform access to heterogeneous data sources, dataspac...
Xin Dong, Alon Y. Halevy