Sciweavers

931 search results - page 115 / 187
» Storage and Querying of E-Commerce Data
Sort
View
CIKM
2010
Springer
13 years 7 months ago
Computing the top-k maximal answers in a join of ranked lists
Complex search tasks that utilize information from several data sources, are answered by integrating the results of distinct basic search queries. In such integration, each basic ...
Mirit Shalem, Yaron Kanza
EDBT
2009
ACM
184views Database» more  EDBT 2009»
14 years 3 months ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer
SIGMOD
1998
ACM
142views Database» more  SIGMOD 1998»
14 years 1 months ago
Dimensionality Reduction for Similarity Searching in Dynamic Databases
Databases are increasingly being used to store multi-media objects such as maps, images, audio and video. Storage and retrieval of these objects is accomplished using multi-dimens...
Kothuri Venkata Ravi Kanth, Divyakant Agrawal, Amb...
SISAP
2008
IEEE
188views Data Mining» more  SISAP 2008»
14 years 3 months ago
High-Dimensional Similarity Retrieval Using Dimensional Choice
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
Dave Tahmoush, Hanan Samet
VLDB
2004
ACM
128views Database» more  VLDB 2004»
14 years 2 months ago
An Annotation Management System for Relational Databases
We present an annotation management system for relational databases. In this system, every piece of data in a relation is assumed to have zero or more annotations associated with ...
Deepavali Bhagwat, Laura Chiticariu, Wang Chiew Ta...