Sciweavers

1542 search results - page 161 / 309
» Redundancy in Spatial Databases
Sort
View
KDD
2005
ACM
104views Data Mining» more  KDD 2005»
14 years 10 months ago
Mining tree queries in a graph
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
Bart Goethals, Eveline Hoekx, Jan Van den Bussche
POPL
2007
ACM
14 years 10 months ago
Extracting queries by static analysis of transparent persistence
Transparent persistence promises to integrate programming languages and databases by allowing procedural programs to access persistent data with the same ease as non-persistent da...
Ben Wiedermann, William R. Cook
SCCC
2005
IEEE
14 years 3 months ago
Optimizing repair programs for consistent query answering
Databases may not satisfy integrity constraints (ICs) for several reasons. Nevertheless, in most of the cases an important part of the data is still consistent wrt certain desired...
Mónica Caniupán Marileo, Leopoldo E....
ADC
2003
Springer
162views Database» more  ADC 2003»
14 years 3 months ago
Automated Data Warehousing for Rule-based CRM Systems
This paper proposes a novel way of automatically developing data warehouse configuration in rule-based CRM systems. Rule-based CRM systems assume that marketing activities are re...
Han-joon Kim, Taehee Lee, Sang-goo Lee, Jonghun Ch...
COMAD
2009
13 years 11 months ago
Modeling Relational Data as Graphs for Mining
The focus of this paper is to develop algorithms and a framework for modeling transactional data stored in relational database into graphs for mining. Most of the real-world trans...
Subhesh Pradhan, Sharma Chakravarthy, Aditya Telan...