Sciweavers

2675 search results - page 107 / 535
» From Ontology to Relational Databases
Sort
View
IDEAS
2005
IEEE
109views Database» more  IDEAS 2005»
16 years 1 days ago
Efficient Relational Joins with Arithmetic Constraints on Multiple Attributes
We introduce and study a new class of queries that we refer to as ACMA (arithmetic constraints on multiple attributes) queries. Such combinatorial queries require the simultaneous...
Chuang Liu, Lingyun Yang, Ian T. Foster
PODS
2008
ACM
141views Database» more  PODS 2008»
16 years 6 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
SIGCSE
1996
ACM
163views Education» more  SIGCSE 1996»
15 years 10 months ago
Database theory in practice: learning from cooperative group projects
lhis paper describes the use of cooperative group learning concepts in support of an undergraduate database mrtnagement course that emphasizes the theoretical and practical aspect...
Suzanne W. Dietrich, Susan Darling Urban
ICDE
1999
IEEE
107views Database» more  ICDE 1999»
16 years 7 months ago
Using Codewords to Protect Database Data from a Class of Software Errors
Increasingly, for extensibility and performance, specialpurpose application code is being integrated with database system code. Such application code has direct access to database...
Philip Bohannon, Rajeev Rastogi, S. Seshadri, Abra...
DILS
2006
Springer
15 years 10 months ago
Link Discovery in Graphs Derived from Biological Databases
Public biological databases contain vast amounts of rich data that can also be used to create and evaluate new biological hypothesis. We propose a method for link discovery in biol...
Petteri Sevon, Lauri Eronen, Petteri Hintsanen, Ki...