| Mathes F. Schmidt J.W. Bulk Types; Built-in or Added-on? Proceedings of the Third International Workshop on Database Programming Languages, Nafplion, Greece (August 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 ....
Mathes F. Schmidt J.W. Bulk Types; Built-in or Added-on? Proceedings of the Third International Workshop on Database Programming Languages, Nafplion, Greece (August 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