Sciweavers

8838 search results - page 1551 / 1768
» Generalizing Domain Theory
Sort
View
PODS
2007
ACM
142views Database» more  PODS 2007»
16 years 6 months ago
Quasi-inverses of schema mappings
Schema mappings are high-level specifications that describe the relationship between two database schemas. Two operators on schema mappings, namely the composition operator and th...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...
PODS
2007
ACM
171views Database» more  PODS 2007»
16 years 6 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
PODS
2008
ACM
165views Database» more  PODS 2008»
16 years 6 months ago
Data exchange and schema mappings in open and closed worlds
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
Leonid Libkin, Cristina Sirangelo
EDBT
2008
ACM
150views Database» more  EDBT 2008»
16 years 6 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
160
Voted
ICSE
2005
IEEE-ACM
16 years 6 months ago
Verifying safety policies with size properties and alias controls
Many software properties can be analysed through a relational size analysis on each function's inputs and outputs. Such relational analysis (through a form of dependent typin...
Wei-Ngan Chin, Siau-Cheng Khoo, Shengchao Qin, Cor...
« Prev « First page 1551 / 1768 Last » Next »