Sciweavers

813 search results - page 64 / 163
» Languages for Relational Databases over Interpreted Structur...
Sort
View
EDBT
2000
ACM
14 years 3 days ago
A Data Model for Effectively Computable Functions
the research activities. This abstract is to introduce the approach of a data model - EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectiv...
Kevin H. Xu
PODS
2008
ACM
141views Database» more  PODS 2008»
14 years 8 months ago
On the complexity of deriving schema mappings from database instances
We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of ...
Pierre Senellart, Georg Gottlob
ICALP
1998
Springer
14 years 21 days ago
Constraint Automata and the Complexity of Recursive Subtype Entailment
Abstract. We study entailment of structural and nonstructural recursive subtyping constraints. Constraints are formal inequalities between type expressions, interpreted over an ord...
Fritz Henglein, Jakob Rehof
RULES
1993
Springer
159views Database» more  RULES 1993»
14 years 17 days ago
Implementing Relationships and Constraints in an Object-Oriented Database Using a Monitor Construct
Semantic models have shown the utility of arbitrary user-de ned relationships for de ning the semantics of database information, while objectoriented models have developed a stron...
Michael Doherty, Joan Peckham, Victor Fay Wolfe
CICLING
2008
Springer
13 years 10 months ago
A Distributed Database System for Developing Ontological and Lexical Resources in Harmony
In this article, we present the basic ideas of creating a new information-rich lexical database of Dutch, called Cornetto, that is interconnected with corresponding English synsets...
Ales Horák, Piek Vossen, Adam Rambousek