Sciweavers

2121 search results - page 74 / 425
» Indexing Incomplete Databases
Sort
View
ICDE
1996
IEEE
228views Database» more  ICDE 1996»
16 years 3 months ago
Similarity Indexing with the SS-tree
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...
David A. White, Ramesh Jain
106
Voted
DASFAA
1999
IEEE
84views Database» more  DASFAA 1999»
15 years 6 months ago
P-Tree: A B-Tree Index for Lists
The high frequency of applications involving large, ordered, nested lists suggests that list is the "next most" natural data type after set. A list differs from a set th...
Ke Wang, Beng Chin Ooi, Sam Yuan Sung
SIGMOD
1999
ACM
112views Database» more  SIGMOD 1999»
15 years 6 months ago
A New Method for Similarity Indexing of Market Basket Data
In recent years, many data mining methods have been proposed for finding useful and structured information from market basket data. The association rule model was recently propos...
Charu C. Aggarwal, Joel L. Wolf, Philip S. Yu
103
Voted
CVIU
2008
113views more  CVIU 2008»
15 years 2 months ago
Indexing through laplacian spectra
With ever growing databases containing multimedia data, indexing has become a necessity to avoid a linear search. We propose a novel technique for indexing multimedia databases in...
M. Fatih Demirci, Reinier H. van Leuken, Remco C. ...
ICDE
2009
IEEE
186views Database» more  ICDE 2009»
16 years 4 months ago
A Benchmark for Online Index Selection
Online approaches to physical design tuning have received considerable attention in the recent literature, with a focus on the problem of online index selection. However, it is dif...
Karl Schnaitter, Neoklis Polyzotis