Sciweavers

559 search results - page 26 / 112
» Indexing Weighted-Sequences in Large Databases
Sort
View
ICDE
1996
IEEE
228views Database» more  ICDE 1996»
14 years 9 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
DASFAA
1999
IEEE
84views Database» more  DASFAA 1999»
13 years 12 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
2002
ACM
169views Database» more  SIGMOD 2002»
14 years 7 months ago
Covering indexes for branching path queries
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...
ICMCS
2006
IEEE
110views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Multimedia indexing and fast retrieval based on a vote system
We present a new system, called Retimm, for searching databases made of documents containing images and text. Images are indexed by colour and texture distributions.. Colour and t...
Sylvie Philipp-Foliguet, Guillaume Logerot, Patric...
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
14 years 7 months ago
Approximate String Search in Spatial Databases
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...