M. Atkinson, P. Richard, and P. Trinder. Bulk Types for Large Scale Programming. In Proceedings of the Kiev East/West Workshop on Next Generation Database Technology, volume 504 of Lecture Notes in Computer Science, April 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and predicatebased procedural database programming language [SEM88] We illustrate issues in language design, system construction and application programming involving built in bulk types. Since others have already discussed the general properties and requirements of bulk types in some detail [ART91] section 2.4 only summarizes the gist of built in and add on bulk types in terms of their elementary and advanced demands. In section 3 we point out some of the more severe limitations of the built in approach that provide a strong incentive to look for systematic add on approaches to bulk type ....

....module declarations etc. Furthermore, values of relation types adhere to standard naming, typing, binding, scoping and persistence rules. A closer look at DBPL reveals, however, some complications inherent in all bulk types (relations, maps, etc. that are to provide associative element access [ART91, SDDS86, SFL83] In DBPL, the key of a relation defines a list of components of the relation element type that uniquely determines each relation element. Key components have to define total functions over the domain of possible relation elements. Therefore, they must not be components of variant ....

[Article contains additional citation context not shown here]

M. Atkinson, P. Richard, and P. Trinder. Bulk Types for Large Scale Programming. In Proceedings of the Kiev East/West Workshop on Next Generation Database Technology, volume 504 of Lecture Notes in Computer Science, April 1991.

....within a database. The importance of algebraic specification for specifying schemas and for supporting a functional style of database computations has been emphasized by previous research, such as that reported in [16, 9, 10] it is also closely related to the topic of collection or bulk types [7, 12]. Object oriented modules support the declarative definition of class hierarchies of objects that can be updated and queried in a distributed fashion by means of messages. 2 System modules, of which object oriented modules are a special case, are not discussed in this paper; see [29] ....

M. Atkinson, P. Richard, and P. Trinder. Bulk types for large scale programming. In Proc. Next Generation Information System Technology, pages 228--250. Springer LNCS 504, 1991.

....of lists e 1 and e 2 . In this case is associative but is neither commutative nor idempotent; and dc is the identity for . ffl Other possibilities include orsets, certain kinds of tree, finite maps, arrays, etc. See Libkin and myself [131] Watt and Trinder [199] Atkinson, Richard, and Trinder [10]; and Buneman [32] Tannen and Subrahmanyam [28] described one way, depicted in Figure 1.2, of doing structural recursion of the above view of collection types that is inspired by the notion of universal property. u : t Theta t t f : s t i : t sru(u; f; i) dsc t obeying the following ....

Malcolm Atkinson, Philippe Richard, and Phil Trinder. Bulk types for large scale programming. In J. W. Schmidt and A. A. Stogny, editors, LNCS 504: Next Generation Information System Technology, pages 229--250, Berlin, 1990. Springer-Verlag.

....same manner. By necessity, this tutorial cannot be a comprehensive survey. My own work and related papers have influenced the choice of topics. The bibliography that follows is similarly affected. 2 A Bibliography As early as in [Sch78] and then more recently in e.g. AB87, HS89, ADG 89, SS89, ART90, ABD 90, MS91, AL 91, RS91, SP91, LMS 94] the design and implementation of collection types (sometimes called less ceremoniously bulk types) is identified as a key issue in database programming languages. The collection type constructs surveyed in this tutorial are related to ....

Malcolm Atkinson, Philippe Richard, and Phil Trinder. Bulk types for large scale programming. In J. W. Schmidt and A. A. Stogny, editors, LNCS 504: Next Generation Information System Technology, pages 229--250, Berlin, 1990. Springer-Verlag.

....in full. They cover very nearly all of the requirements on a good development programming language and on a good database management system (DBMS) Three omission deserve comment. 9 Query Systems Our past experience suggests that it is reasonable to expect to build these within the language [99, 132, 52, 21, 24, 124, 162]. We agree that bulk operations and queries are useful. But they are useful over any large, regularly structured data structure, irrespective of its location and longevity. Indexes Again, we hold that these are best built within the language. They then gain the portability of implementations ....

M.P. Atkinson, P. Richard, and P.W. Trinder. Bulk types for large scale programming. In Schmidt and Stogny [189], pages 228--250.

....Sets A set, conventionally written in the style f2; 3; 5; 7; 11g, is written in our notation as [2; 3; 5; 7; 11] set . The set operation Phi is just set union, and has several properties: ffl It is associative, because the order of combination does not matter. For example, 2; 3] Phi [5]) Phi [7; 11] 2; 3] Phi ( 5] Phi [7; 11] ffl It is idempotent, because duplicates do not count. For example, 2; 3] Phi [2; 3] 2; 3] ffl It is commutative, because the order of elements does not matter. For example, 2; 3] Phi [5; 7; 11] 5; 7; 11] Phi [2; 3] Hence, for sets to ....

....written in the style f2; 3; 5; 7; 11g, is written in our notation as [2; 3; 5; 7; 11] set . The set operation Phi is just set union, and has several properties: ffl It is associative, because the order of combination does not matter. For example, 2; 3] Phi [5] Phi [7; 11] 2; 3] Phi ([5] Phi [7; 11] ffl It is idempotent, because duplicates do not count. For example, 2; 3] Phi [2; 3] 2; 3] ffl It is commutative, because the order of elements does not matter. For example, 2; 3] Phi [5; 7; 11] 5; 7; 11] Phi [2; 3] Hence, for sets to be collections we must show that ....

[Article contains additional citation context not shown here]

Atkinson, M.P., Richard, P., and Trinder, P.W. Bulk Types for Large Scale Programming. Proceedings of Information Systems for the 90's, Kiev, Ukraine (October 1990).

....bill of material query are improved. Many language designers believe that a DBPL should support a rich set of data types to enable the application programmer to model the problem domain in a natural way. The data types that are queried contain large amounts of data and are termed bulk data types [5, 17]. Sets, relations, bags, lists, trees, graphs and finite maps are all examples of bulk types that might be found in a DBPL with a rich type system. Unfortunately, supporting several bulk types adds complexity to the language because constructs must exist to declare, populate, query and modify ....

....integer values are not interrogated. The data types that are interrogated are those that contain large amounts of data, such as sets, list or trees. Such types are called Bulk Data Types and are characterised by the fact that the size of the value is independent of the size of the type description [5, 17]. Supporting many bulk types can introduce complexity into the application programmer s world. Language constructs must exist to declare, populate and query each bulk type. Let us consider the task of querying the bulk types. In Napier, for instance, a procedure that expresses a query over a tree ....

Atkinson M.P. Richard P. Trinder P.W. Bulk Types for Large Scale Programming. Proceedings of Information Systems for the 90's, Kiev, Ukraine (October 1990).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC