Sciweavers

214 search results - page 24 / 43
» Foundations of probabilistic answers to queries
Sort
View
ICDT
2003
ACM
132views Database» more  ICDT 2003»
14 years 1 months ago
Probabilistic Interval XML
Interest in XML databases has been growing over the last few years. In this paper, we study the problem of incorporating probabilistic information into XML databases. We propose th...
Edward Hung, Lise Getoor, V. S. Subrahmanian
MICAI
2005
Springer
14 years 1 months ago
Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
Edgar Chávez, Karina Figueroa, Gonzalo Nava...
SIGMOD
2011
ACM
250views Database» more  SIGMOD 2011»
12 years 11 months ago
Hybrid in-database inference for declarative information extraction
In the database community, work on information extraction (IE) has centered on two themes: how to effectively manage IE tasks, and how to manage the uncertainties that arise in th...
Daisy Zhe Wang, Michael J. Franklin, Minos N. Garo...
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
14 years 10 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
PODS
2009
ACM
130views Database» more  PODS 2009»
14 years 9 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti