Sciweavers

34 search results - page 4 / 7
» The difficulty of schema conformance problems
Sort
View
ICDE
2006
IEEE
122views Database» more  ICDE 2006»
14 years 1 months ago
Pragmatics and Open Problems for Inter-schema Constraint Theory
We consider pragmatic issues in applying constraint-based theories (such as that developed for data exchange) to a variety of problems. We identify disconnects between theoreticia...
Arnon Rosenthal, Leonard J. Seligman
ICEIS
2006
IEEE
14 years 1 months ago
Filtering Unsatisfiable XPATH Queries
The satisfiability test checks, whether or not the evaluation of a query returns the empty set for any input document, and can be used in query optimization for avoiding the submis...
Jinghua Groppe, Sven Groppe
COMPSAC
2010
IEEE
13 years 2 months ago
Metamodel Recovery from Multi-tiered Domains Using Extended MARS
With the rapid development of model-driven engineering (MDE), domain-specific modeling has become a widely used software development technique. In MDE, metamodels represent a schem...
Qichao Liu, Barrett R. Bryant, Marjan Mernik
IAT
2006
IEEE
14 years 1 months ago
An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
Viswanath Avasarala, Himanshu Polavarapu, Tracy Mu...
PODS
2004
ACM
86views Database» more  PODS 2004»
14 years 7 months ago
Frontiers of Tractability for Typechecking Simple XML Transformations
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus...
Wim Martens, Frank Neven