Sciweavers

1268 search results - page 187 / 254
» On database query languages for K-relations
Sort
View
SIGMOD
2009
ACM
142views Database» more  SIGMOD 2009»
14 years 9 months ago
A grammar-based entity representation framework for data cleaning
Fundamental to data cleaning is the need to account for multiple data representations. We propose a formal framework that can be used to reason about and manipulate data represent...
Arvind Arasu, Raghav Kaushik
KDD
1998
ACM
148views Data Mining» more  KDD 1998»
14 years 1 months ago
Group Bitmap Index: A Structure for Association Rules Retrieval
Discovery of association rules from large databases of item sets is an important data mining problem. Association rules are usually stored in relational databases for future use i...
Tadeusz Morzy, Maciej Zakrzewicz
DOOD
1997
Springer
155views Database» more  DOOD 1997»
14 years 1 months ago
Incremental Updates for Materialized OQL Views
Abstract. This work discusses the CROQUE approach to the maintenance problem for materialized views. In a CROQUE database, application-speci ed collections (type extents or classes...
Dieter Gluche, Torsten Grust, Christof Mainberger,...
EDBTW
2006
Springer
14 years 18 days ago
Models for Incomplete and Probabilistic Information
Abstract. We discuss, compare and relate some old and some new models for incomplete and probabilistic databases. We characterize the expressive power of c-tables over infinite dom...
Todd J. Green, Val Tannen
COLING
1996
13 years 10 months ago
Error-tolerant Tree Matching
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree appro,imately, that is, within a certain error toleranc...
Kemal Oflazer