Sciweavers

664 search results - page 6 / 133
» Generalized Search Trees for Database Systems
Sort
View
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 2 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
ICDE
2007
IEEE
228views Database» more  ICDE 2007»
15 years 6 months ago
A General Cost Model for Dimensionality Reduction in High Dimensional Spaces
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
Xiang Lian, Lei Chen 0002
PODS
2010
ACM
150views Database» more  PODS 2010»
15 years 4 months ago
Understanding queries in a search database system
It is well known that a search engine can significantly benefit from an auxiliary database, which can suggest interpretations of the search query by means of the involved concep...
Ronald Fagin, Benny Kimelfeld, Yunyao Li, Sriram R...
DOLAP
2003
ACM
15 years 5 months ago
Spatial hierarchy and OLAP-favored search in spatial data warehouse
Data warehouse and Online Analytical Processing(OLAP) play a key role in business intelligent systems. With the increasing amount of spatial data stored in business database, how ...
Fangyan Rao, Long Zhang, Xiulan Yu, Ying Li, Ying ...
WWW
2009
ACM
16 years 15 days ago
Exploiting web search engines to search structured databases
Web search engines often federate many user queries to relevant structured databases. For example, a product related query might be federated to a product database containing thei...
Arnd Christian König, Dong Xin, Kaushik Chakr...