Sciweavers

1358 search results - page 58 / 272
» An inductive database and query language in the relational m...
Sort
View
PODS
2009
ACM
134views Database» more  PODS 2009»
16 years 6 months ago
Equivalence of nested queries with mixed semantics
We consider the problem of deciding query equivalence for a conjunctive language in which queries output complex objects composed from a mixture of nested, unordered collection ty...
David DeHaan
DEXA
1995
Springer
125views Database» more  DEXA 1995»
15 years 10 months ago
An SQL Extension Supporting User Viewpoints
- In order to accomplish independence on the logical data organization, a relational DBMS must be capable of interpreting query language sentences which reference attributes belong...
Giuseppe Bellavia, Dario Maio, Stefano Rizzi
HASKELL
2006
ACM
16 years 8 days ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser
GEOINFO
2003
15 years 7 months ago
Efficient Query Processing on the Relational Quadtree
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 8 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich