Sciweavers

677 search results - page 118 / 136
» The XML Typechecking Problem
Sort
View
MFCS
2009
Springer
15 years 4 months ago
Query Automata for Nested Words
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We deď...
P. Madhusudan, Mahesh Viswanathan
DOCENG
2009
ACM
15 years 4 months ago
On the analysis of queries with counting constraints
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
Everardo Bárcenas, Pierre Genevès, N...
COLCOM
2008
IEEE
15 years 4 months ago
Defending against Attribute-Correlation Attacks in Privacy-Aware Information Brokering
Nowadays, increasing needs for information sharing arise due to extensive collaborations among organizations. Organizations desire to provide data access to their collaborators whi...
Fengjun Li, Bo Luo, Peng Liu, Anna Cinzia Squiccia...
ER
2007
Springer
127views Database» more  ER 2007»
15 years 4 months ago
Generic Schema Mappings
Schema mappings come in different flavors: simple correspondences are produced by schema matchers, intensional mappings are used for schema integration. However, the execution of ...
David Kensche, Christoph Quix, Yong Li, Matthias J...
ICDE
2006
IEEE
143views Database» more  ICDE 2006»
15 years 4 months ago
Effectiveness Bounds for Non-Exhaustive Schema Matching Systems
Semantic validation of the effectiveness of a schema matching system is traditionally performed by comparing system-generated mappings with those of human evaluators. The human ef...
Marko Smiljanic, Maurice van Keulen, Willem Jonker