Sciweavers

79 search results - page 12 / 16
» Representing Tuple and Attribute Uncertainty in Probabilisti...
Sort
View
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
13 years 11 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
ICDE
2004
IEEE
125views Database» more  ICDE 2004»
14 years 8 months ago
Range CUBE: Efficient Cube Computation by Exploiting Data Correlation
Data cube computation and representation are prohibitively expensive in terms of time and space. Prior work has focused on either reducing the computation time or condensing the r...
Ying Feng, Divyakant Agrawal, Amr El Abbadi, Ahmed...
KDD
1998
ACM
129views Data Mining» more  KDD 1998»
13 years 11 months ago
Data Reduction Based on Hyper Relations
Data reduction makes datasets smaller but preserves classication structures of interest. It is an important area of research in data mining and databases. In this paper we present...
Hui Wang, Ivo Düntsch, David A. Bell
IPM
2006
167views more  IPM 2006»
13 years 6 months ago
Browsing mixed structured and unstructured data
Both structured and unstructured data, as well as structured data representing several different types of tuples, may be integrated into a single list for browsing or retrieval. D...
Robert M. Losee
PVLDB
2010
98views more  PVLDB 2010»
13 years 5 months ago
On-the-Fly Entity-Aware Query Processing in the Presence of Linkage
Entity linkage is central to almost every data integration and data cleaning scenario. Traditional techniques use some computed similarity among data structure to perform merges a...
Ekaterini Ioannou, Wolfgang Nejdl, Claudia Nieder&...