Sciweavers

2229 search results - page 48 / 446
» The Case for Grounding Databases
Sort
View
PODS
2007
ACM
131views Database» more  PODS 2007»
16 years 1 months ago
Provenance semirings
We show that relational algebra calculations for incomplete databases, probabilistic databases, bag semantics and whyprovenance are particular cases of the same general algorithms...
Todd J. Green, Gregory Karvounarakis, Val Tannen
CAISE
2006
Springer
15 years 5 months ago
Adaptive Query Formulation to Handle Database Evolution
Databases are continuously evolving environments, where design constructs are added, removed or updated quite often. Research has extensively dealt with the problem of database evo...
George Papastefanatos, Panos Vassiliadis, Yannis V...
IJCIS
1998
78views more  IJCIS 1998»
15 years 1 months ago
Merging Databases Under Constraints
The problem of integrating information from con icting sources comes up in many current applications, such as cooperative information systems, heterogeneous databases, and multi-a...
Jinxin Lin, Alberto O. Mendelzon
CIIA
2009
15 years 2 months ago
Appling A Discrete Particle Swarm Optimization Algorithm to Database Vertical Partition
Vertical partition is an important technique in database design used to enhance performance in database systems. Vertical fragmentation is a combinatorial optimization problem that...
Bilal Benmessahel, Mohamed Touahria
SIGMOD
2000
ACM
143views Database» more  SIGMOD 2000»
15 years 5 months ago
Closest Pair Queries in Spatial Databases
This paper addresses the problem of finding the K closest pairs between two spatial data sets, where each set is stored in a structure belonging in the R-tree family. Five diffe...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...