Sciweavers

785 search results - page 9 / 157
» Efficient Processing of Top-k Queries in Uncertain Databases
Sort
View
SIGMOD
2009
ACM
125views Database» more  SIGMOD 2009»
14 years 7 months ago
Top-k queries on uncertain data: on score distribution and typical answers
Uncertain data arises in a number of domains, including data integration and sensor networks. Top-k queries that rank results according to some user-defined score are an important...
Tingjian Ge, Stanley B. Zdonik, Samuel Madden
ICDE
2006
IEEE
162views Database» more  ICDE 2006»
14 years 9 months ago
Efficient Batch Top-k Search for Dictionary-based Entity Recognition
We consider the problem of speeding up Entity Recognition systems that exploit existing large databases of structured entities to improve extraction accuracy. These systems requir...
Amit Chandel, P. C. Nagesh, Sunita Sarawagi
PVLDB
2008
160views more  PVLDB 2008»
13 years 7 months ago
BayesStore: managing large, uncertain data repositories with probabilistic graphical models
Several real-world applications need to effectively manage and reason about large amounts of data that are inherently uncertain. For instance, pervasive computing applications mus...
Daisy Zhe Wang, Eirinaios Michelakis, Minos N. Gar...
INFORMATICALT
2008
162views more  INFORMATICALT 2008»
13 years 7 months ago
Vague Rough Set Techniques for Uncertainty Processing in Relational Database Model
Abstract. The study of databases began with the design of efficient storage and data sharing techniques for large amount of data. This paper concerns the processing of imprecision ...
Karan Singh, Samajh Singh Thakur, Mangi Lal
ICDE
2006
IEEE
194views Database» more  ICDE 2006»
14 years 9 months ago
The Gauss-Tree: Efficient Object Identification in Databases of Probabilistic Feature Vectors
In applications of biometric databases the typical task is to identify individuals according to features which are not exactly known. Reasons for this inexactness are varying meas...
Alexey Pryakhin, Christian Böhm, Matthias Sch...