检索结果-内蒙古大学图书馆

database programming languages - 11th international symposium, dbpl 2007, Revised Selected Papers

11th international symposium on database programming languages, dbpl 2007

ISBN: (纸本)9783540759867

the proceedings contain 16 papers. the topics discussed include: efficient algorithms for the tree homeomorphism problem;a methodology for coupling fragments of XPath with structural indexes for XML documents;conjunctive query containment over trees;a better semantics for XQuery with side-effects;repairing inconsistent XML write-access control policies;on the consistent rewriting of conjunctive queries under primary key constraints;relational completeness of query languages for annotated databases;a theory of stream queries;querying structural and behavioral properties of business processes;succinctness of pattern-based schema languages for XML;analysis of imperative XML programs;efficient inclusion for a class of XML types with interleaving and counting;and towards practical typechecking for macro tree transducers.

关键词： Relational database systems

来源：评论

学校读者我要写书评

暂无评论

Variational databases 16

Variational Databases

引用

16th international symposium on database programming languages (dbpl)

作者： Ataei, Parisa Termehchy, Arash Walkingshaw, Eric Oregon State Univ Corvallis OR 97331 USA

ISBN: (纸本)9781450353540

Data variations are prevalent in real-world applications. For example, software vendors handle variations in the business requirements, conventions, and environmental settings of a software product using hundreds of features each combination of which creates a different version of the product. In database-backed software, the database of each version may have a different schema and different content. Variations in the value and representation of each element in a dataset give rise to numerous variants in these applications. Users often would like to express information needs over all such variants. For example, a software vendor would like to perform common tests over all versions of its product, e.g., whether each relation in a relational database has a primary key. Hence, users need a query interface that hides the variational nature of the data and processes a query over all variations of a dataset. We propose a novel abstraction called a variational database that provides a compact and structured representation of general forms of data variations and enables users to query database variations easily.

关键词： Data Variation Variational Schema Variational database

来源：评论

学校读者我要写书评

暂无评论

Locomotor: Transparent Migration of Client-Side database Code 16

Locomotor: Transparent Migration of Client-Side Database Cod...

引用

16th international symposium on database programming languages (dbpl)

作者： Mior, Michael J. Univ Waterloo 200 Univ Ave West Waterloo ON N2L 3G1 Canada

ISBN: (纸本)9781450353540

Server-side execution is a well-known method for improving the performance of database applications. Running code on the database server eliminates round trips to the client application resulting in significantly reduced latency. However, the common approach of explicitly writing server-side code in stored procedures has significant drawbacks. Application developers must develop and maintain code in two separate languages and manually partition code between the client and server. Code shipping is a viable alternative but still requires an explicit specification of which code can be run on the server. We propose a hybrid shipping approach based on static analysis which automatically partitions client code and only ships code to the server which is likely to improve performance. We demonstrate the viability of this approach in a prototype system which we call Locomotor. Locomotor operates on Python applications using the Redis key-value store. through static analysis, it identifies fragments of code which can benefit from being executed on the server and automatically performs translation to execute the fragments on the server. Unlike some previous systems, Locomotor is not pattern-based and is able to ship a wide variety of code. By shipping code to the server, Locomotor is able to achieve significant performance gains over client-side execution with no modifications to the application code.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

ACM international Conference Proceeding Series

ACM International Conference Proceeding Series

引用

16th international symposium on database programming languages, dbpl 2017

ISBN: (纸本)9781450353540

the proceedings contain 10 papers. the topics discussed include: modern stored procedures using GraalVM;bridging the semantical gap between relational data and application-level business objects with core data services;DDO-free XQuery;from relation algebra to semi-join algebra: an approach for graph query optimization;the data cube as a typed linear algebra operator;AL: unified analytics in domain specific terms;property-based testing of SPARQL queries;counting types for massive JSON datasets;locomotor: transparent migration of client-side database code;and GraphScript: implementing complex graph algorithms in SAP HANA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

database programming languages 1

引用

丛书名： Lecture Notes in Computer Science

1000年

ISBN: (数字)9783540759874

ISBN: (纸本)9783540759867

this volume contains the proceedings of the 11th international symposium on database programming languages (dbpl 2007), held in Vienna, Austria, on September 23–24, 2007. dbpl 2007 was one of 15 meetings co-located with VLDB (the international Conference on Very Large Data Bases). dbplcontinues to presentthe verybest workat the intersectionof database and programming language research. the proceedings include a paper based on the invited talk by Wenfei Fan and the 16 contributed papers that were selected by the programcommittee from 41 submissions. Every submission was reviewed by at least three members of the program committee. In addition, the program committee sought the opinions of additional referees, selected because of their expertise on particular topics. the ?nal selection of papers was made during the last week of July. We would like to thank all of the authors who submitted papers to the c- ference, and the members of the program committee for their excellent work. the program committee did not meet in person, but carried out extensive d- cussions during the electronic PC meeting. We are grateful to Andrei Voronkov for his EasyChair system that made it so easy to manage these discussions. Finally, we would also like to thank Christoph Koch and Gavin Bierman for their assistance and sound counsel, and the organizers of VLDB 2007 for taking care of the local organization of dbpl.

关键词： Data Structures and Information theory programming languages, Compilers, Interpreters database Management Information Storage and Retrieval Information Systems Applications (incl. Internet) Data Storage Representation

来源：评论

学校读者我要写书评

暂无评论

database Queries that Explain their Work 14

Database Queries that Explain their Work

引用

16th international symposium on Principles and Practice of Declarative programming (PPDP)

作者： Cheney, James Ahmed, Amal Acar, Umut A. Univ Edinburgh Edinburgh Midlothian Scotland Northeastern Univ Boston MA 02115 USA Carnegie Mellon Univ Pittsburgh PA 15213 USA INRIA Rocquencourt Le Chesnay France

ISBN: (纸本)9781450329477

Provenance for database queries or scientific workflows is often motivated as providing explanation, increasing understanding of the underlying data sources and processes used to compute the query, and reproducibility, the capability to recompute the results on different inputs, possibly specialized to a part of the output. Many provenance systems claim to provide such capabilities;however, most lack formal definitions or guarantees of these properties, while others provide formal guarantees only for relatively limited classes of changes. Building on recent work on provenance traces and slicing for functional programming languages, we introduce a detailed tracing model of provenance for multiset-valued Nested Relational Calculus, define trace slicing algorithms that extract subtraces needed to explain or recompute specific parts of the output, and define query slicing and differencing techniques that support explanation. We state and prove correctness properties for these techniques and present a proof-of-concept implementation in Haskell.

关键词： provenance database queries slicing

来源：评论

学校读者我要写书评

暂无评论

Cut and paste

引用

JOURNAL OF COMPUTER AND SYSTEM SCIENCES 1999年第3期58卷 453-482页

作者： Mecca, G Atzeni, P Univ Basilicata DIFA I-85100 Potenza Italy Univ Roma Tre Dipartimento Informat & Automaz I-00146 Rome Italy

the paper develops EDITOR, a language for manipulating semistructured documents, such as those typically available on the Web. EDITOR programs are based on two simple ideas, taken from text editors: "search" instructions are used to select regions of interest in a document, and "cut & paste" instructions to restructure them. We study the expressive power and the complexity of these programs. We show that they are computationally complete, in the sense that any computable document restructuring can be expressed in EDITOR. We also study the complexity of a safe subclass of programs, showing that it captures exactly the class of polynomial-time restructurings. the language has been implemented in Java and is currently used in the ARANEUS project as a basis for a wrapper-generation toolkit. (C) 1999 Academic Press.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

On notions of regularity for data languages

引用

16th international symposium on Fundamentals of Computation theory

作者： Bjorklund, Henrik Schwentick, thomas Tech Univ Dortmund Comp Sci Chair 1 D-44227 Dortmund Germany

ISBN: (纸本)9783540742395

With motivation from considerations in XML database theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position, a symbol and a data value from an infinite domain. Previous work has shown that it is difficult to come up with an expressive yet decidable automaton model for data languages. Recently, such a model, data automata, was introduced. this paper introduces a simpler but equivalent model and investigates its expressive power, algorithmic and closure properties, and some extensions. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

A study on knowledge transfer between programming languages by programs meanings facets 2017

A study on knowledge transfer between programming languages ...

引用

16th Brazilian symposium on Human Factors in Computing Systems, IHC 2017

作者： Barata, Pablo Eduardo Cabral Corrêa, João Victor P. Mota, Marcelle Pereira Universidade Federal Do Pará Belém Brazil Bolsista Do Programa de Iniciação Científica da UFPA Brazil

ISBN: (纸本)9781450363778

this paper presents a study about how different ways of representing meanings in programs can help in knowledge transfer of programming logic from a visual programming language to a textual programming language. these representations were carried out based on a model grounded on Semiotic Engineering theory from Blocky, a visual programming tool made by Google. the representations, named facets of meanings, have the main goal of assisting in the teaching and learning process of programming languages. An assessment of the produced facets with programming novices revealed that they are accomplishing part of their purposes, and there is evidence of the potential of this kind of technology in this context. © 2017 Association for Computing Machinery.

关键词： Visual languages

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 16th Workshop on Quantitative Aspects of programming languages and Systems, QAPL 2019

Proceedings - 16th Workshop on Quantitative Aspects of Progr...

引用

8th international symposium on Highly-Efficient Accelerators and Reconfigurable Technologies, HEART 2017

the proceedings contain 4 papers. the topics discussed include: quantitative aspects of programming languages and systems over the past 2-4 years and beyond;towards digital twins for the description of automotive software systems;a faster-than relation for semi-Markov decision processes;and probabilistic output analyses for deterministic programs â€" reusing existing non-probabilistic analyses.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：