Sciweavers

189 search results - page 19 / 38
» Approximating predicates and expressive queries on probabili...
Sort
View
EDBT
2009
ACM
127views Database» more  EDBT 2009»
14 years 3 months ago
Approximate substring selectivity estimation
We study the problem of estimating selectivity of approximate substring queries. Its importance in databases is ever increasing as more and more data are input by users and are in...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
ERCIMDL
2007
Springer
87views Education» more  ERCIMDL 2007»
14 years 2 months ago
A Model of Uncertainty for Near-Duplicates in Document Reference Networks
We introduce a model of uncertainty where documents are not uniquely identified in a reference network, and some links may be incorrect. It generalizes the probabilistic approach ...
Claudia Hess, Michel de Rougemont
VLDB
2001
ACM
82views Database» more  VLDB 2001»
14 years 1 months ago
Supporting Incremental Join Queries on Ranked Inputs
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
Apostol Natsev, Yuan-Chi Chang, John R. Smith, Chu...
EDBT
1998
ACM
114views Database» more  EDBT 1998»
14 years 25 days ago
HySpirit - A Probabilistic Inference Engine for Hypermedia Retrieval in Large Databases
Abstract. HySpirit is a retrieval engine for hypermedia retrieval integrating concepts from information retrieval (IR) and deductive databases. The logical view on IR models retrie...
Norbert Fuhr, Thomas Rölleke
ADBIS
2009
Springer
108views Database» more  ADBIS 2009»
14 years 3 months ago
Probabilistic Granule-Based Inside and Nearest Neighbor Queries
The development of location-based services and advances in the field of mobile computing have motivated an intensive research effort devoted to the efficient processing of locati...
Sergio Ilarri, Antonio Corral, Carlos Bobed, Eduar...