Sciweavers

70 search results - page 8 / 14
» Semistructured data schemas with expressive constraints
Sort
View
ADC
2003
Springer
162views Database» more  ADC 2003»
14 years 29 days 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...
DEXAW
1999
IEEE
137views Database» more  DEXAW 1999»
14 years 1 days ago
Reasoning with Enhanced Temporal Entity-Relationship Models
Recent efforts in the Conceptual Modelling community have been devoted to properly capturing time-varying information, and several proposals of temporally enhanced Entity-Relation...
Alessandro Artale, Enrico Franconi
OWLED
2008
13 years 9 months ago
Opening, Closing Worlds - On Integrity Constraints
In many data-centric applications it is desirable to use OWL as an expressive schema language where one expresses constraints that need to be satisfied by the (instance) data. Howe...
Evren Sirin, Michael Smith, Evan Wallace
ICDE
1996
IEEE
120views Database» more  ICDE 1996»
14 years 9 months ago
Towards the Reverse Engineering of Denormalized Relational Databases
This paper describes a method to cope with denormalized relational schemas in a database reverse engineering process. We propose two main steps to irnprove the understanding of da...
Jean-Marc Petit, Farouk Toumani, Jean-Franç...
CIKM
2008
Springer
13 years 9 months ago
Linear time membership in a class of regular expressions with interleaving and counting
The extension of Regular Expressions (REs) with an interleaving (shuffle) operator has been proposed in many occasions, since it would be crucial to deal with unordered data. Howe...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani