標(biāo)題: Titlebook: Database Programming Languages (DBPL-4); Proceedings of the F Catriel Beeri,Atsushi Ohori,Dennis E. Shasha Conference proceedings 1994 Spri [打印本頁(yè)] 作者: obsess 時(shí)間: 2025-3-21 18:52
書(shū)目名稱Database Programming Languages (DBPL-4)影響因子(影響力)
書(shū)目名稱Database Programming Languages (DBPL-4)影響因子(影響力)學(xué)科排名
書(shū)目名稱Database Programming Languages (DBPL-4)網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Database Programming Languages (DBPL-4)網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Database Programming Languages (DBPL-4)被引頻次
書(shū)目名稱Database Programming Languages (DBPL-4)被引頻次學(xué)科排名
書(shū)目名稱Database Programming Languages (DBPL-4)年度引用
書(shū)目名稱Database Programming Languages (DBPL-4)年度引用學(xué)科排名
書(shū)目名稱Database Programming Languages (DBPL-4)讀者反饋
書(shū)目名稱Database Programming Languages (DBPL-4)讀者反饋學(xué)科排名
作者: Cervical-Spine 時(shí)間: 2025-3-21 22:55 作者: ALTER 時(shí)間: 2025-3-22 01:04
How Dogmatic Can Materialism Be? is created and manipulated in a uniform manner, regardless of how long it persists. A common approach in existing persistent systems is to structure the store in terms of procedures. This paper describes a new programming language which provides support for persistent modules and protection based o作者: 鳴叫 時(shí)間: 2025-3-22 08:08 作者: 合乎習(xí)俗 時(shí)間: 2025-3-22 09:15 作者: Obligatory 時(shí)間: 2025-3-22 13:03
Mind, Brain, and the Symbolic Consciousnessg. We present a formal definition of bulk data types, based on parameterized algebraic specifications. We then define appropriate relationships between bulk types, and show that BDTs together with such relationships form a category with sets as the terminal object. We consider how to apply structura作者: Obligatory 時(shí)間: 2025-3-22 18:27
How Dogmatic Can Materialism Be?he relational language of Breazu-Tannen, Buneman and Wong, which is known to have precisely the power of the nested relational algebra. Relative strength of additional polynomial constructs is studied, and the ambient language endowed with the strongest combination of those constructs is chosen as a作者: 蔑視 時(shí)間: 2025-3-23 00:28 作者: exquisite 時(shí)間: 2025-3-23 01:34 作者: 預(yù)定 時(shí)間: 2025-3-23 08:36 作者: demote 時(shí)間: 2025-3-23 10:04
Mind, Brain, and the Symbolic Consciousnessthe question prompts us to address a different, though related question: What are appropriate abstractions for expressing object-oriented query execution plans? Our answer takes the form of a language that can serve as the interface between an optimizer and an execution engine. Our query execution l作者: precede 時(shí)間: 2025-3-23 17:12 作者: 異端 時(shí)間: 2025-3-23 21:57
Cognitive Models of Consciousnessptimize them. A two-phase approach is used to optimize nested queries in the object-oriented context. The first phase—called .—transforms queries at the query language level in order to treat common subexpressions and independent subqueries more efficiently. The transformed queries are translated to作者: Pelago 時(shí)間: 2025-3-24 01:36
Matti Kamppinen,Antti Revonsuo,Seppo Sajamaclass hierarchies. More specifically, we consider two different problems: (1) statically reduce the number of constraints to be checked, and (2) generate an efficient run time checker. Using simple strategies, one can significantly improve the efficiency of the verification. We show how to reduce th作者: STEER 時(shí)間: 2025-3-24 04:49 作者: Indurate 時(shí)間: 2025-3-24 07:59 作者: 是比賽 時(shí)間: 2025-3-24 14:02 作者: 音樂(lè)學(xué)者 時(shí)間: 2025-3-24 16:53 作者: 偽書(shū) 時(shí)間: 2025-3-24 21:44
978-3-540-19853-6Springer-Verlag Berlin Heidelberg 1994作者: 昏迷狀態(tài) 時(shí)間: 2025-3-25 00:23
Database Programming Languages (DBPL-4)978-1-4471-3564-7Series ISSN 1431-1682 作者: certitude 時(shí)間: 2025-3-25 04:22
https://doi.org/10.1007/978-1-4684-2196-5ecidable in general. Nevertheless, simple syntactic restrictions on the calculus result in computable languages. We provide here two restricted calculi with bounded complexity, and show that the restrictions are minimal. Indeed, any looser restriction leads to non computable queries.作者: Injunction 時(shí)間: 2025-3-25 11:13
https://doi.org/10.1007/978-1-4684-2196-5t as a part of the EREQ project. The model adopts a uniform view of objects and values and separates syntactic, semantic, and implementation concerns. The algebra addresses issues of type-defined equality and duplicate elimination as well as extensions to bulk types other than sets.作者: Radiculopathy 時(shí)間: 2025-3-25 15:20 作者: 同位素 時(shí)間: 2025-3-25 16:16 作者: Obstreperous 時(shí)間: 2025-3-25 23:03
The AQUA Data Model and Algebrat as a part of the EREQ project. The model adopts a uniform view of objects and values and separates syntactic, semantic, and implementation concerns. The algebra addresses issues of type-defined equality and duplicate elimination as well as extensions to bulk types other than sets.作者: 鳴叫 時(shí)間: 2025-3-26 02:26 作者: malign 時(shí)間: 2025-3-26 07:28
Nested Queries in Object Baseshe query language level in order to treat common subexpressions and independent subqueries more efficiently. The transformed queries are translated to nested algebraic expressions. These entail nested loop evaluation which may be very inefficient. Hence, the second phase . nested algebraic expres-sions to allow for more efficient evaluation.作者: 碌碌之人 時(shí)間: 2025-3-26 09:28
How Dogmatic Can Materialism Be?n capabilities. It is shown how the module structure provides explicit support for sharing and simplifies the development of reusable components. The capability structure allows control over access to data and supports deletion of objects in a controlled manner.作者: 惡意 時(shí)間: 2025-3-26 14:37
How Dogmatic Can Materialism Be?ific data, etc. require database support for ordered data structures like lists, trees, and graphs. In this paper, we discuss an extension to the AQUA query algebra to handle ordered types and their operators. We show how these operators can fit into a framework for query optimization.作者: monogamy 時(shí)間: 2025-3-26 17:53
Consciousness, Knowledge, and Truthcoding of . with unbounded fixpoints into flat relations. We also define a complex object logic based language with fixpoints and prove that its range restricted fragment is equivalent to . with bounded fixpoints.作者: vitrectomy 時(shí)間: 2025-3-26 22:56 作者: 顯而易見(jiàn) 時(shí)間: 2025-3-27 03:10
Bounded Fixpoints for Complex Objectscoding of . with unbounded fixpoints into flat relations. We also define a complex object logic based language with fixpoints and prove that its range restricted fragment is equivalent to . with bounded fixpoints.作者: 混合物 時(shí)間: 2025-3-27 09:20
The Triumph of the Rational Subjectare not the most technically superior, and SQL became the dominant language in the relational database world, despite many clearly better ideas: Quel and E-Quel from Ingres, the Relational Model book produced by Michael Brodie et al, and so forth. Now SQL is the standard database interface even if your database is not relational!作者: Amylase 時(shí)間: 2025-3-27 11:56 作者: 有危險(xiǎn) 時(shí)間: 2025-3-27 17:27
Matti Kamppinen,Antti Revonsuo,Seppo Sajamaon. We also show how to generate efficient algorithms for checking a large class of constraints. We show how all the techniques presented took great advantage of the underlying type system which provide a significant help both in solving (1) and (2). Last the current status of the Thémis prototype is presented.作者: Palpable 時(shí)間: 2025-3-27 18:23
Anil K. Maheshwari,Rakesh Guptaver these languages: it is naturally embedded in functional languages, it is readily extensible, and it has a compact equational theory. Therefore, it is used in this report as a basis for investigating aggregate functions.作者: languor 時(shí)間: 2025-3-28 01:58 作者: Control-Group 時(shí)間: 2025-3-28 03:07
A Functional Object Database LanguageL and these functional languages have w.r.t. each other in terms of (i) the above-mentioned flexibility in the type system, which we consider essential for . and (ii) the orthogonality of the language.作者: gerrymander 時(shí)間: 2025-3-28 07:09
Thémis: a database programming language with integrity constraintson. We also show how to generate efficient algorithms for checking a large class of constraints. We show how all the techniques presented took great advantage of the underlying type system which provide a significant help both in solving (1) and (2). Last the current status of the Thémis prototype is presented.作者: MAIM 時(shí)間: 2025-3-28 12:14
Aggregate Functions, Conservative Extension, and Linear Ordersver these languages: it is naturally embedded in functional languages, it is readily extensible, and it has a compact equational theory. Therefore, it is used in this report as a basis for investigating aggregate functions.作者: Limpid 時(shí)間: 2025-3-28 16:07
Linguistic Support for Persistent Modules and Capabilitiesn capabilities. It is shown how the module structure provides explicit support for sharing and simplifies the development of reusable components. The capability structure allows control over access to data and supports deletion of objects in a controlled manner.作者: Extort 時(shí)間: 2025-3-28 20:27
1431-1682 City, 30 August-1 September 1993. The areas of interest and the format of DBPL-4 focused on the integration of programming languages, object models, type systems and database systems. As in the previous DBPL workshops, the setting was informal, allowing the participants to actively discuss and argu作者: 強(qiáng)壯 時(shí)間: 2025-3-29 02:08
Mind, Brain, and the Symbolic Consciousnessn bulk types, and show that BDTs together with such relationships form a category with sets as the terminal object. We consider how to apply structural recursion (using a function called .) to all bulk types, and show how equationally constrained BDTs imply similar constraints on the arguments to ..作者: Ceremony 時(shí)間: 2025-3-29 06:09 作者: progestin 時(shí)間: 2025-3-29 07:31
Conference proceedings 1994August-1 September 1993. The areas of interest and the format of DBPL-4 focused on the integration of programming languages, object models, type systems and database systems. As in the previous DBPL workshops, the setting was informal, allowing the participants to actively discuss and argue about th作者: 運(yùn)動(dòng)性 時(shí)間: 2025-3-29 12:10 作者: 暫時(shí)別動(dòng) 時(shí)間: 2025-3-29 16:34
Extensible Grammars for Language Specializationdefinitions, query expressions, etc., and a small, simple core language. We address this dilemma by proposing extensible grammars, a syntax-definition formalism for incremental language extensions and restrictions based on an initial core language..The translation of programs written in rich object 作者: Lumbar-Stenosis 時(shí)間: 2025-3-29 23:21 作者: indubitable 時(shí)間: 2025-3-29 23:53 作者: 指耕作 時(shí)間: 2025-3-30 07:59
Calculi for Bags and their Complexityecidable in general. Nevertheless, simple syntactic restrictions on the calculus result in computable languages. We provide here two restricted calculi with bounded complexity, and show that the restrictions are minimal. Indeed, any looser restriction leads to non computable queries.作者: 紳士 時(shí)間: 2025-3-30 10:22
Bulk Data Types, A Theoretical Approachg. We present a formal definition of bulk data types, based on parameterized algebraic specifications. We then define appropriate relationships between bulk types, and show that BDTs together with such relationships form a category with sets as the terminal object. We consider how to apply structura作者: PURG 時(shí)間: 2025-3-30 12:44 作者: Tidious 時(shí)間: 2025-3-30 18:37
Ordered Types in the AQUA Data Modelance. This relationship can be a total or partial order among the elements or among equivalence classes where each equivalence class consists of one or more elements. In terms of data structures, ordered types can be viewed as graphs, trees, or lists..Lately there has been a lot of interest in bulk 作者: resilience 時(shí)間: 2025-3-30 22:33
A Functional Object Database Languageet strong and statically checked, type system. Its main source of flexibility is its support for object evolution, that is, dynamic type changes of existing objects. Originally, BCOOL was used as a formal basis for a more traditional (relational algebra-style) database language, COOL. In this paper,作者: minimal 時(shí)間: 2025-3-31 04:08
The AQUA Data Model and Algebrat as a part of the EREQ project. The model adopts a uniform view of objects and values and separates syntactic, semantic, and implementation concerns. The algebra addresses issues of type-defined equality and duplicate elimination as well as extensions to bulk types other than sets.作者: Consensus 時(shí)間: 2025-3-31 05:38
An Abstract Object-Oriented Query Execution Languagethe question prompts us to address a different, though related question: What are appropriate abstractions for expressing object-oriented query execution plans? Our answer takes the form of a language that can serve as the interface between an optimizer and an execution engine. Our query execution l作者: BRAND 時(shí)間: 2025-3-31 10:01 作者: ADORE 時(shí)間: 2025-3-31 15:14
