作者: 現(xiàn)暈光 時間: 2025-3-21 21:05 作者: Intentional 時間: 2025-3-22 01:22 作者: fertilizer 時間: 2025-3-22 05:55 作者: 現(xiàn)任者 時間: 2025-3-22 09:03
Fluorescence Recovery After Photobleachingn be extended to maintain the views without performing this additional work..We describe the implementation of these techniques in the SWORD interface to the Ode database system. The implementation is based on the representation of nested structures by classes and the use of an SQL-like language to 作者: Externalize 時間: 2025-3-22 13:16 作者: Externalize 時間: 2025-3-22 20:32 作者: Eeg332 時間: 2025-3-22 22:31
Panel session: Metadata for database interoperation,作者: 針葉樹 時間: 2025-3-23 01:27 作者: GOAT 時間: 2025-3-23 06:18
Degrees of monotonicity of spatial transformations, class with a finite number of degrees of freedom. In particular, we show that these transformations are finite unions of transformations that can be written in a particular conjunctive form. We also address the problem of finding sound and complete languages for monotonic transformations that are e作者: POWER 時間: 2025-3-23 13:03
Querying sequence databases with transducers,nown complexity classes, such as polynomial time and hyper-exponential time. We establish a tight relationship between levels in this hierarchy and the depth of subroutine calls within Transducer Datalog programs. Finally, we show that Transducer Datalog programs of arbitrary depth express exactly t作者: 雪白 時間: 2025-3-23 14:55
A structure-based approach to querying semi-structured data,duced graph schemas [BDFS97]. A storage schema splits the graph‘s edges into several relations, some of which may have labels of known types (such as strings or integers) while others may be still dynamically typed. We show here that all positive queries in UnQL, a query language for semistructured 作者: Hypomania 時間: 2025-3-23 18:00 作者: Adornment 時間: 2025-3-24 00:04
Incremental recomputation of recursive queries with nested sets and aggregate functions,, is still maintainable using only fiat relations. We also show that one does not need auxiliary relations of arity more than 2. In particular, this implies that the recursive queries maintainable in the nested language with aggregates, can be also maintained in a practical relational database syste作者: PANG 時間: 2025-3-24 04:10 作者: 瑪瑙 時間: 2025-3-24 09:24
Burkhard Schnepel,Edward A. Alpersnt system can capture subtleties that go far beyond the level of expressiveness of object-oriented type systems. The temporal nature of the language and its distinctive orthogonal model of persistence make this language system successful in handling a variety of non-trivial applications.作者: 打火石 時間: 2025-3-24 12:23
Alan Wassyng,Mark Lawford,Tom Maibaum preliminary results on the expressiveness of hybrid languages. In particular, we show that relatively simple hybrid languages are able to define all finite structures expressed by skolemized universally quantified second-order formulae with some constraints on the quantified predicates.作者: Inflamed 時間: 2025-3-24 16:44
Kun Wei,Jim Woodcock,Alan Burnsthe introduction and elimination of aggregation functions, and the promotion of aggregation functions through iteration operations. We also show how some of these equivalences can be used to optimise comprehensions, a high-level query construct supported by many database languages.作者: 爭吵 時間: 2025-3-24 21:14 作者: RALES 時間: 2025-3-25 00:51 作者: muster 時間: 2025-3-25 03:59
Formal foundations for optimising aggregation functions in database programming languages,the introduction and elimination of aggregation functions, and the promotion of aggregation functions through iteration operations. We also show how some of these equivalences can be used to optimise comprehensions, a high-level query construct supported by many database languages.作者: 媒介 時間: 2025-3-25 09:53
https://doi.org/10.1007/978-3-319-59725-6ng on .. The data initially in vector mode was loaded into the database after a translation to constraint representation. Although it is too early to speak of performance since not all operations have been optimized yet, our experience with DEDALE demonstrates already the advantages of the constraint approach for spatial manipulation.作者: 護(hù)航艦 時間: 2025-3-25 15:37 作者: 打火石 時間: 2025-3-25 19:33 作者: 有發(fā)明天才 時間: 2025-3-25 21:47 作者: 鞠躬 時間: 2025-3-26 02:13
0302-9743 DBPL-6, held in Estes Park, Colorado, USA, in August 1997. The 20 revised full papers presented have gone through two rounds of reviewing and selection. Also included are two invited talks, the transcription of a panel discussion and an introductory survey by the volume editors. The papers address 作者: jaundiced 時間: 2025-3-26 07:20
Conference proceedings 1998eld in Estes Park, Colorado, USA, in August 1997. The 20 revised full papers presented have gone through two rounds of reviewing and selection. Also included are two invited talks, the transcription of a panel discussion and an introductory survey by the volume editors. The papers address all curren作者: Arable 時間: 2025-3-26 10:34 作者: 衰弱的心 時間: 2025-3-26 14:12 作者: 凝乳 時間: 2025-3-26 19:52
https://doi.org/10.1007/978-1-4471-2297-5s the transitive closure in an extension of relational calculus with grouping and aggregation. This extension allows us to use rational arithmetic and operations such as summation and product over a column. So, aggregation that exceeds what is allowed by most commercial systems is still not powerful enough to encode recursion mechanisms.作者: overbearing 時間: 2025-3-26 21:50 作者: 拖債 時間: 2025-3-27 01:40
Object views and database restructuring, operators, namely . and ., that specify both the virtual sclaetna and its corresponding virtual instance. This simple algebra call express most of the view operators proposed in the literature a ad provides a real restructuring of the source schema and instance.作者: ethnology 時間: 2025-3-27 08:28 作者: anachronistic 時間: 2025-3-27 11:11 作者: browbeat 時間: 2025-3-27 16:47
Integrating organisational and transactional aspects of cooperative activities,nal aspects of cooperative activities, based on the CoACT cooperative transaction model. The novelty of the language lies in its ability to deal with a broad spectrum of cooperative applications, ranging from cooperative document authoring to workflow applications.作者: finale 時間: 2025-3-27 21:03
S. Rajaraajeswari,R. Selvarani,Pethuru Rajr seminal paper of 1990. In this area, databases and query languages are defined using read polynomial constraints. As a consequence of a classical result by Tarski, first-order queries in the constraint database model are effectively computable, and their result is within the constraint model..In p作者: babble 時間: 2025-3-28 00:46
https://doi.org/10.1007/978-3-319-59725-6ect-oriented framework, with spatial data represented using linear constraints over a dense domain. The query language is the standard OQL, with special functions for constraint solving and geometric operations..A simple geographical application from the French Institute for Geography, IGN, is runni作者: ANN 時間: 2025-3-28 03:12
Burkhard Schnepel,Edward A. Alpers a hierarchy of monotonicity classes of spatial transformations that is determined by the number of degrees of freedom of the transformations. The result of a monotonic transformation with .degrees of freedom on a spatial database is completely determined by its result on subsets of casdinality at m作者: 充滿裝飾 時間: 2025-3-28 08:55
Burkhard Schnepel,Edward A. Alpershes to the covariance/contravariance problem. While the existing object-oriented type systems are based on subtyping, F-bounded polymorphism and matching, this language system is based entirely on inheritance, which is identified with matching. The type of matching used in this paper relies on the t作者: 格言 時間: 2025-3-28 11:56 作者: cumulative 時間: 2025-3-28 14:56
Applications of Connectivity Studiesons, such as text databases and genome databases, the storage and manipulation of long character sequences is a crucial feature. The issues involved in managing this kind of data are not addressed by traditional database systems, either in theory or in practice. To address these issues, in recent wo作者: 清醒 時間: 2025-3-28 21:48
Large Network Models and Their Implicationsbeled graphs. Data in this model is self-describing and dynamically typed, and captures both schema and data information. The labels are arbitrary atomic values, such as strings, integers, reals, etc., and the integrated data graph is stored in a unique data repository, as a relation of .. The relat作者: NOMAD 時間: 2025-3-28 23:48
Phase Transitions in Large Networkss of the modeled universe. A formal model of such a database is presented. VQL, which is based on a first order calculus, provides users with the ability of navigating through object versions, and through the states of the universe modeled by the multiversion database.作者: 移植 時間: 2025-3-29 06:49 作者: 言外之意 時間: 2025-3-29 08:59
Fluorescence Recovery After Photobleachingore flat relations. This paper discusses a broader class of view definitions-materialized views defined over a nested data model such as the nested relational model or an object-oriented data model. An attribute of a tuple deriving the view can be a reference (i.e., a pointer) to a nested relation, 作者: Aerate 時間: 2025-3-29 14:20
Gap Junction Morphology and Dynamics in Situ queries such as transitive closure, and “alternating paths” can be incrementally maintained in a nested relational language, when some auxiliary relations are allowed. In the presence of aggregate functions, even more queries can be maintained, for example, the “same generation” query. In contrast,作者: Fermentation 時間: 2025-3-29 18:23
https://doi.org/10.1007/978-1-4471-2297-5 results is sometimes a nontrivial task. In this paper, we tell the story of the work on expressive power of relational languages with aggregate functions. We also prove by far the most powerful result that describes the expressiveness of such languages. There are four main features of our result th作者: 入會 時間: 2025-3-29 22:46
Alan Wassyng,Mark Lawford,Tom Maibaumh as Datalog, so as to achieve the best characteristics of both kinds of formalisms in a common framework. Formal analysis on such hybrid languages has been limited to computational complexity: i.e., how much time/space it is needed to answer to a specific query? This paper carries out a different f作者: Inclement 時間: 2025-3-30 03:34 作者: 莎草 時間: 2025-3-30 05:05
Lloyd Motz,Jefferson Hane Weaver is supported by an emerging category of software technology, called On-Line Analytical Processing (OLAP). In spite of a lot of commercial tools already available, a fundamental study for OLAP systems is still lacking. In this paper we introduce a model and a query language to establish a theoretica作者: 人類學(xué)家 時間: 2025-3-30 11:31 作者: 鐵塔等 時間: 2025-3-30 12:49 作者: 多嘴 時間: 2025-3-30 20:18
978-3-540-64823-9Springer-Verlag Berlin Heidelberg 1998作者: 矛盾 時間: 2025-3-31 00:28
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/263369.jpg作者: FAST 時間: 2025-3-31 03:00 作者: Misnomer 時間: 2025-3-31 07:46
Phase Transitions in Large Networkss of the modeled universe. A formal model of such a database is presented. VQL, which is based on a first order calculus, provides users with the ability of navigating through object versions, and through the states of the universe modeled by the multiversion database.作者: aptitude 時間: 2025-3-31 09:40
The Rescue: A Romance of the Shallows,nal aspects of cooperative activities, based on the CoACT cooperative transaction model. The novelty of the language lies in its ability to deal with a broad spectrum of cooperative applications, ranging from cooperative document authoring to workflow applications.作者: 享樂主義者 時間: 2025-3-31 16:24
Euclid, Tarski, and Engeler encompassed,r seminal paper of 1990. In this area, databases and query languages are defined using read polynomial constraints. As a consequence of a classical result by Tarski, first-order queries in the constraint database model are effectively computable, and their result is within the constraint model..In p作者: STANT 時間: 2025-3-31 20:39
, a spatial constraint database,ect-oriented framework, with spatial data represented using linear constraints over a dense domain. The query language is the standard OQL, with special functions for constraint solving and geometric operations..A simple geographical application from the French Institute for Geography, IGN, is runni作者: comely 時間: 2025-3-31 23:21
Degrees of monotonicity of spatial transformations, a hierarchy of monotonicity classes of spatial transformations that is determined by the number of degrees of freedom of the transformations. The result of a monotonic transformation with .degrees of freedom on a spatial database is completely determined by its result on subsets of casdinality at m作者: conscribe 時間: 2025-4-1 03:40
Constrained matching is type safe,hes to the covariance/contravariance problem. While the existing object-oriented type systems are based on subtyping, F-bounded polymorphism and matching, this language system is based entirely on inheritance, which is identified with matching. The type of matching used in this paper relies on the t作者: 付出 時間: 2025-4-1 07:25 作者: CREEK 時間: 2025-4-1 11:54 作者: 樹木中 時間: 2025-4-1 16:57
A structure-based approach to querying semi-structured data,beled graphs. Data in this model is self-describing and dynamically typed, and captures both schema and data information. The labels are arbitrary atomic values, such as strings, integers, reals, etc., and the integrated data graph is stored in a unique data repository, as a relation of .. The relat
