Sciweavers

1591 search results - page 246 / 319
» Atomicity for XML Databases
Sort
View
SIGMOD
2008
ACM
127views Database» more  SIGMOD 2008»
15 years 3 months ago
Minimization of tree pattern queries with constraints
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
Ding Chen, Chee Yong Chan
VLDB
2002
ACM
166views Database» more  VLDB 2002»
15 years 3 months ago
COMA - A System for Flexible Combination of Schema Matching Approaches
Schema matching is the task of finding semantic correspondences between elements of two schemas. It is needed in many database applications, such as integration of web data source...
Hong Hai Do, Erhard Rahm
VLDB
2002
ACM
116views Database» more  VLDB 2002»
15 years 3 months ago
The Denodo Data Integration Platform
The world today is characterised by the proliferation of information sources available through media such as the WWW, databases, semi-structured files (e.g. XML documents), etc. N...
Alberto Pan, Juan Raposo, Manuel Álvarez, P...
ICDT
2011
ACM
270views Database» more  ICDT 2011»
14 years 7 months ago
On the equivalence of distributed systems with queries and communication
Distributed data management systems consist of peers that store, exchange and process data in order to collaboratively achieve a common goal, such as evaluate some query. We study...
Serge Abiteboul, Balder ten Cate, Yannis Katsis
ICDT
2012
ACM
226views Database» more  ICDT 2012»
13 years 6 months ago
Bounded repairability for regular tree languages
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
Gabriele Puppis, Cristian Riveros, Slawek Staworko