Sciweavers

699 search results - page 5 / 140
» Strong types for relational databases
Sort
View
PODS
1999
ACM
89views Database» more  PODS 1999»
13 years 10 months ago
Type Inference in the Polymorphic Relational Algebra
We give a polymorphic account of the relational algebra. We introduce a formalism of \type formulas" speci cally tuned for relational algebra expressions, and present an algo...
Jan Van den Bussche, Emmanuel Waller
PPDP
2004
Springer
13 years 11 months ago
Characterizing strong normalization in a language with control operators
We investigate some fundamental properties of the reduction relation in the untyped term calculus derived from Curien and Herbelin’s λµµ. The original λµµ has a system of ...
Daniel J. Dougherty, Silvia Ghilezan, Pierre Lesca...
VLDB
2005
ACM
120views Database» more  VLDB 2005»
13 years 11 months ago
Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases
With the increasing occurrence of temporal and spatial data in present-day database applications, the interval data type is adopted by more and more database systems. For an effic...
Jost Enderle, Nicole Schneider, Thomas Seidl
ICDE
2008
IEEE
182views Database» more  ICDE 2008»
14 years 4 hour ago
Two-phase schema matching in real world relational databases
— We propose a new approach to the problem of schema matching in relational databases that merges the hybrid and composite approach of combining multiple individual matching tech...
Nikolaos Bozovic, Vasilis Vassalos
CIKM
2005
Springer
13 years 11 months ago
Joint deduplication of multiple record types in relational data
Record deduplication is the task of merging database records that refer to the same underlying entity. In relational databases, accurate deduplication for records of one type is o...
Aron Culotta, Andrew McCallum