Titlebook: Research Issues in Structured and Semistructured Database Programming; 7th International Wo Richard Connor,Alberto Mendelzon Conference pro

法官所用

书目名称Research Issues in Structured and Semistructured Database Programming影响因子(影响力)




书目名称Research Issues in Structured and Semistructured Database Programming影响因子(影响力)学科排名




书目名称Research Issues in Structured and Semistructured Database Programming网络公开度




书目名称Research Issues in Structured and Semistructured Database Programming网络公开度学科排名




书目名称Research Issues in Structured and Semistructured Database Programming被引频次




书目名称Research Issues in Structured and Semistructured Database Programming被引频次学科排名




书目名称Research Issues in Structured and Semistructured Database Programming年度引用




书目名称Research Issues in Structured and Semistructured Database Programming年度引用学科排名




书目名称Research Issues in Structured and Semistructured Database Programming读者反馈




书目名称Research Issues in Structured and Semistructured Database Programming读者反馈学科排名

EXALT

不公开

粗鲁性质

Extensions of Attribute Grammars for Structured Document Queries lence problem to be complete for EXPTIME. As an application we show that the Region Algebra expressions can be efficiently translated into extended AGs. This translation drastically improves the known upper bound on the complexity of the emptiness and equivalence test for Re- gion Algebra expressio

滋养

天空

A Framework for Optimizing Distributed Workflow ExecutionsCFs). In the framework, a workflow schema is first rewritten as a family of CFs that are essentially atomic and execute in parallel. The CFs can be grouped into “clusters”. Several CFs can be combined to form a single CF, which is useful when executing a sub-schema on a limited processor. Local rewr

Picks-Disease

Union Types for Semistructured Dataed types are often minor, and we believe that a better strategy than throwing away all type information is to preserve as much of it as possible. We describe a system of untagged . that can accommodate variations in structure while still allowing a degree of static type checking. A novelty of this s

Modify

Query Optimization for Semistructured Data Using Path Constraints in a Deterministic Data Model of P., denoted by P., by representing paths as regular expressions. The implication problems for these constraint languages are studied in the context of the .. It is shown that in contrast to the undecidability result of [.], the implication and finite implication problems for P. are decidable in

Expurgate

Expressing topological connectivity of spatial databaseshem interesting objects of study..Previously, spatial Datalog programs have been studied for more restric- tive forms of connectivity (e.g., piece-wise linear connectivity) and these programs were proved to correctly test connectivity on restricted classes of spatial databases (e.g., linear database

负担

A Representation Independent Language for Planar Spatial Databases with Euclidean Distancen the encoding and thus do not have any natural meaning. In this paper, we propose an alternative approach and develop an algebraic language in which the traditional operators and Euclidean constructions work directly on the data represented by “semi-circular” constraints. By avoiding the encoding s