Sciweavers

29 search results - page 2 / 6
» Effectiveness Bounds for Non-Exhaustive Schema Matching Syst...
Sort
View
ICDE
2008
IEEE
182views Database» more  ICDE 2008»
13 years 10 months 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
EDBT
2008
ACM
124views Database» more  EDBT 2008»
14 years 4 months ago
Scalable XQuery type matching
XML Schema awareness has been an integral part of the XQuery language since its early design stages. Matching XML data against XML types is the main operation that backs up XQuery...
Jens Teubner
CORR
2010
Springer
127views Education» more  CORR 2010»
12 years 11 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...
SAC
2006
ACM
13 years 10 months ago
Automatic structured query transformation over distributed digital libraries
Structured data and complex schemas are becoming the main way to represent the information many Digital Libraries provide, thus impacting the services they offer. When searching i...
M. Elena Renda, Umberto Straccia
SIGMOD
2007
ACM
111views Database» more  SIGMOD 2007»
14 years 4 months ago
Query relaxation using malleable schemas
In contrast to classical databases and IR systems, real-world information systems have to deal increasingly with very vague and diverse structures for information management and s...
Xuan Zhou, Julien Gaugaz, Wolf-Tilo Balke, Wolfgan...