Titlebook: Database Programming Languages; 6th International Wo Sophie Cluet,Rick Hull Conference proceedings 1998 Springer-Verlag Berlin Heidelberg 1

cumulative

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

清醒

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

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.

移植

言外之意

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

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

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

入會(huì)

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

莎草

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