Sciweavers

3420 search results - page 78 / 684
» Proximity Search in Databases
Sort
View
PETRA
2009
ACM
14 years 2 months ago
Towards faster activity search using embedding-based subsequence matching
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
Panagiotis Papapetrou, Paul Doliotis, Vassilis Ath...
ERCIMDL
2009
Springer
139views Education» more  ERCIMDL 2009»
14 years 2 months ago
Geographic Information Retrieval and Digital Libraries
In this demonstration we will examine the effectiveness of Geographic Information Retrieval (GIR) methods in digital library interfaces. We will show how various types of informat...
Ray R. Larson
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
13 years 5 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
DEXA
1999
Springer
181views Database» more  DEXA 1999»
14 years 7 hour ago
Combining Pat-Trees and Signature Files for Query Evaluation in Document Databases
In this paper, a new indexing technique to support the query evaluation in document databases is proposed. The key idea of the method is the combination of the technique of pat-tre...
Yangjun Chen, Karl Aberer
VLDB
1990
ACM
100views Database» more  VLDB 1990»
13 years 11 months ago
Indexing in a Hypertext Database
Databaseindexing is a well studied problem. However, the advent of Hypertext databasesopensnew questionsin indexing. Searches are often demarcated by pointers between text items. ...
Chris Clifton, Hector Garcia-Molina