Sciweavers

48 search results - page 8 / 10
» Database Support for Probabilistic Attributes and Tuples
Sort
View
ICDE
2004
IEEE
179views Database» more  ICDE 2004»
14 years 9 months ago
CrossMine: Efficient Classification Across Multiple Database Relations
Most of today's structured data is stored in relational databases. Such a database consists of multiple relations which are linked together conceptually via entity-relationsh...
Xiaoxin Yin, Jiawei Han, Jiong Yang, Philip S. Yu
VLDB
2007
ACM
124views Database» more  VLDB 2007»
14 years 1 months ago
Ad-hoc Top-k Query Answering for Data Streams
A top-k query retrieves the k highest scoring tuples from a data set with respect to a scoring function defined on the attributes of a tuple. The efficient evaluation of top-k q...
Gautam Das, Dimitrios Gunopulos, Nick Koudas, Niko...
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...
SIGMOD
2010
ACM
153views Database» more  SIGMOD 2010»
14 years 12 days ago
Threshold query optimization for uncertain data
The probabilistic threshold query (PTQ) is one of the most common queries in uncertain databases, where all results satisfying the query with probabilities that meet the threshold...
Yinian Qi, Rohit Jain, Sarvjeet Singh, Sunil Prabh...
EDBT
2004
ACM
192views Database» more  EDBT 2004»
14 years 7 months ago
LIMBO: Scalable Clustering of Categorical Data
Abstract. Clustering is a problem of great practical importance in numerous applications. The problem of clustering becomes more challenging when the data is categorical, that is, ...
Periklis Andritsos, Panayiotis Tsaparas, Ren&eacut...