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影響因子(影響力)學(xué)科排名




書目名稱Research Issues in Structured and Semistructured Database Programming網(wǎng)絡(luò)公開度




書目名稱Research Issues in Structured and Semistructured Database Programming網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Research Issues in Structured and Semistructured Database Programming被引頻次




書目名稱Research Issues in Structured and Semistructured Database Programming被引頻次學(xué)科排名




書目名稱Research Issues in Structured and Semistructured Database Programming年度引用




書目名稱Research Issues in Structured and Semistructured Database Programming年度引用學(xué)科排名




書目名稱Research Issues in Structured and Semistructured Database Programming讀者反饋




書目名稱Research Issues in Structured and Semistructured Database Programming讀者反饋學(xué)科排名

EXALT

不公開

粗魯性質(zhì)

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

滋養(yǎng)

天空

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

負(fù)擔(dān)

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