Sciweavers

43 search results - page 4 / 9
» The complexity of satisfying constraints on databases of tra...
Sort
View
SEBD
2001
145views Database» more  SEBD 2001»
13 years 8 months ago
Reasoning over Conceptual Schemas and Queries in Temporal Databases
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear ...
Alessandro Artale, Enrico Franconi, Milenko Mosuro...
CP
2007
Springer
14 years 1 months ago
A Compression Algorithm for Large Arity Extensional Constraints
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...
George Katsirelos, Toby Walsh
DOOD
1989
Springer
146views Database» more  DOOD 1989»
13 years 11 months ago
The Object-Oriented Database System Manifesto
This paper attempts to de ne an object-oriented database system. It describes the main features and characteristics that a system must have to qualify as an objectoriented databas...
Malcolm P. Atkinson, François Bancilhon, Da...
ICDE
2011
IEEE
235views Database» more  ICDE 2011»
12 years 11 months ago
Dealing proactively with data corruption: Challenges and opportunities
—The danger of production or backup data becoming corrupted is a problem that database administrators dread. This position paper aims to bring this problem to the attention of th...
Nedyalko Borisov, Shivnath Babu, NagaPramod Mandag...
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 7 months ago
The complexity of reasoning about pattern-based XML schemas
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
Gjergji Kasneci, Thomas Schwentick