Sciweavers

1418 search results - page 25 / 284
» Schema polynomials and applications
Sort
View
PODS
2010
ACM
223views Database» more  PODS 2010»
13 years 9 months ago
Characterizing schema mappings via data examples
Schema mappings are high-level specifications that describe the relationship between two database schemas; they are considered to be the essential building blocks in data exchange...
Bogdan Alexe, Phokion G. Kolaitis, Wang Chiew Tan
PVLDB
2008
146views more  PVLDB 2008»
13 years 6 months ago
Graceful database schema evolution: the PRISM workbench
Supporting graceful schema evolution represents an unsolved problem for traditional information systems that is further exacerbated in web information systems, such as Wikipedia a...
Carlo Curino, Hyun Jin Moon, Carlo Zaniolo
DSN
2004
IEEE
13 years 11 months ago
Cyclic Redundancy Code (CRC) Polynomial Selection For Embedded Networks
Cyclic Redundancy Codes (CRCs) provide a first line of defense against data corruption in many networks. Unfortunately, many commonly used CRC polynomials provide significantly le...
Philip Koopman, Tridib Chakravarty
CONTEXT
2003
Springer
14 years 19 days ago
A SAT-Based Algorithm for Context Matching
The development of more and more complex distributed applications over large networks of computers has raised the problem of semantic interoperability across applications based on ...
Paolo Bouquet, Bernardo Magnini, Luciano Serafini,...
CONTEXT
2007
Springer
13 years 11 months ago
Using Context for the Extraction of Relational Views
The paper presents an approach for automatically extracting views from a relational database schema, based on the knowledge of the application domain. In order to achieve such resu...
Cristiana Bolchini, Elisa Quintarelli, Rosalba Ros...