Sciweavers

1429 search results - page 100 / 286
» Efficient processing of XPath queries using indexes
Sort
View
MTA
1998
119views more  MTA 1998»
13 years 8 months ago
A New Indexing Scheme for Content-Based Image Retrieval
We propose a new efficient indexing scheme, called the HG-tree, to support content-based retrieval in image databases. Image content is represented by a point in a multidimensional...
Guang-Ho Cha, Chin-Wan Chung
CIKM
2010
Springer
13 years 7 months ago
Document allocation policies for selective searching of distributed indexes
Indexes for large collections are often divided into shards that are distributed across multiple computers and searched in parallel to provide rapid interactive search. Typically,...
Anagha Kulkarni, Jamie Callan
SIGMOD
2005
ACM
168views Database» more  SIGMOD 2005»
14 years 9 months ago
No pane, no gain: efficient evaluation of sliding-window aggregates over data streams
Window queries are proving essential to data-stream processing. In this paper, we present an approach for evaluating sliding-window aggregate queries that reduces both space and c...
Jin Li, David Maier, Kristin Tufte, Vassilis Papad...
MMDB
2003
ACM
178views Multimedia» more  MMDB 2003»
14 years 2 months ago
Video query processing in the VDBMS testbed for video database research
The increased use of video data sets for multimedia-based applications has created a demand for strong video database support, including efficient methods for handling the content...
Walid G. Aref, Moustafa A. Hammad, Ann Christine C...
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
13 years 6 months ago
Efficient two-sided error-tolerant search
We consider fast two-sided error-tolerant search that is robust against errors both on the query side (type alogrithm, find documents with algorithm) as well as on the document si...
Hannah Bast, Marjan Celikik