F. Bancilhon, et al. FAD, a powerful and simple database language. In VLDB , 97--105. 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... Thus, while the severe bandwidth limitations, lossy communications, and variable topology of sensor networks mean that the specific implementation techniques used in the two environments must differ, it is still useful to leverage the techniques for aggregate decomposition used in database systems [2, 35]. The approach used in such systems (and followed in TAG) is to implement via three functions: a merging function , an initializer , and an evaluator, In general, has the following structure: where ere d 3 are multi valued partial state records, ....

F. Bancilhon, T. Briggs, S. Khoshafian, and P. Valduriez. FAD, a powerful and simple database language. In VLDB, 1987.

.... while the severe bandwidth limitations, lossy communications, and variable topology of sensor networks means that the specific implementation techniques used in the two environments must differ, it is still useful to leverage the techniques for aggregate decomposition used in database systems [3, 23]. The approach used in such systems (and followed in TAG) is to implement via three functions: a merging function , an initializer , and an evaluator, In general, has the following structure: 23842 20242 where are multi valued partial state records, ....

F. Bancilhon, T. Briggs, S. Khoshafian, and P. Valduriez. FAD, a powerful and simple database language. In VLDB, 1987.

....as our prime example of a collection type. The basic operations for sets have been described in [OBBT89] We brie y review them here: fg empty set, fx 1 ; x 2 ; xn g set constructor, union(s 1 ,s 2 ) set union, and hom(f,op,z,s) homomorphic extension hom is the pump operator in [BBKV88] and is similar to the fold or reduce operators of many functional languages. The meaning of hom is expressed by the equation hom(f ,op,z,fg) z hom(f ,op,z,fxg) f(x) hom(f ,op,z,s) op(hom(f ,op,z,s 1 ) hom(f ,op,z,s 2 ) where s 1 [ s 2 = s and s 1 s 2 = This operation only has ....

F. Bancilhon, T. Briggs, S. Khoshaan, and P. Valduriez. FAD, a powerful and simple database language. In Proc. Intl. Conf. on Very Large Data Bases, pages 97-105, 1988.

....Skolem functions and block structure. 4 Peter Buneman et al. Structural recursion has been known to the functional programming community for many years and appears as the reduce or fold operators of languages such as Lisp, ML and Haskell. It was first proposed for database languages in FAD [BBKV87] and Machiavelli [OBB89] The semantics of recursive programming constructs for collection types was first described by Tannen and Subrahmanyam in [BTS91] Phil Wadler first observed the connection between comprehension for collection types (lists, bags, sets) in [Wad92] and structural recursion. ....

F. Bancilhon, T. Briggs, S. Khoshafian, and P. Valduriez. FAD, a powerful and simple database language. In Proceedings of 13th International Conference on Very Large Data Bases, pages 97--105, 1987.

....this is the case, by identifying a minimal set of flat sequence operations which can support the nested queries. These are simple enough to parallelize, and yet sufficient to implement efficiently OQL style queries on nested collections. 7 1. 2 Related Work Bubba,FAD and SVP Bancilhon et al. [5] describe a database language FAD, designed for a parallel database machine Bubba. FAD is a functional language, featuring nested sets with object identifiers and two main parallel constructs: a parallel map (called filter) and a parallel divide and conquer construct (called pump) Parker et al. ....

F. Bancilhon, T. Briggs, S. Khoshafian, and P. Valduriez. FAD, a powerful and simple database language. In Proceedings of 13th International Conference on Very Large Data Bases, pages 97--105, 1987.

....hierarchy but not the other way round, e.g. a list can be converted into a set but not a set to a list. Part of the collection algebra, the monoid homomorphism described above, and the monad morphism described in [39] bear a striking resemblance even though they were developed independently. FAD [2] is a functional database language designed for a parallel database machine that provides, among others, two collection operations filter and pump. Filter can be defined in terms of iter of the collection algebra by composing the argument functions with single. Pump behaves like reduce except that ....

F. Bancilhon, T. Briggs, S. Khoshafian, and P. Valduriez. FAD, a Powerful and Simple Database Language. In Proceedings of the International Conference on Very Large Data Bases, pages 97--105. Morgan Kaufmann, 1987.

....them close together. We show how this can be achieved and what the consequences are. 1 For this purpose, BCOOL serves as a formal basis for the integration of functional (database) languages supporting polymorphism, static type inferencing, and orthogonality (e.g. as in Machiavelli [16] or FAD [5]) with object oriented data models including objects with subtyping and flexible update facilities (e.g. as in Iris [27] Melampus [17] or COCOON [12] The key objectives are: ffl an extension of the relational algebra to an object query language. We started from relational algebra in order to ....

.... by 0 ) such that they can be used not only within sets: e : f 0 1 ; f 0 m ] project 0 [f1 ; fn ] e) f1 ; fn ] E[ project 0 [f1 ; fn ] e) E[ e ] Then, if a set iterator map is provided (akin to hom in Machiavelli [7] replace [1] or pump in FAD [5]) the previous set oriented operations can, for example, be derived as 16 : project [f1 ; fn ] S) j map[project 0 [f1 ; fn ] e) e : S) Now we can easily extend BCOOL to work on lists of objects. After defining the constructors and deconstructors of lists, as well as an iterator ....

F. Bancilhon, T. Briggs, S. Khoshafian, and P. Valduriez. FAD, a powerful and simple database language. In Proc. Int. Conf. on Very Large Databases, pages 97--105, Brighton, September 1987.

....we explicitly indicate which particular function is meant by subscripting it with its collection type. fold operators and their equivalences have been the subject of much work in the functional programming and database communities, This is work too numerous to fully list here and we refer to [1, 2, 3, 4, 5] as a representative sample. Collection types were first defined by Wadler [18] where their relationship with comprehensions was explored. Our OE is an elaboration of the structural recursion over the union presentation (SRU) of [4, 5] to allow for non terminating computations and infinite ....

F.Bancilhon, T.Briggs, S.Khoshafian and P.Valduriez, FAD, a powerful and simple database language, Proc. 13th VLDB Conference, Brighton, September 1987, pp 97-106.

....union, hom(f ,op,z,s) homomorphic extension The syntax fx 1 ; x 2 ; xng is syntactic shorthand for union(fx 1 g, union(fx 2 g, union( fx ng) Of these operations, hom requires some explanation. This is a primitive function in Machiavelli, similar to the pump operation in FAD [BBKV88] and the fold or reduce of many functional languages. Its definition is hom(f ,op,z,fg) z; hom(f ,op,z,feg) f(e) hom(f ,op,z,union(e 1 ,e 2 ) op(hom(f ,op,z,e 1 ) hom(f ,op,z,e 2 ) for example, a function to check if there is at least one element satisfying property P in a set can ....

F. Bancilhon, T. Briggs, S. Khoshafian, and P. Valduriez. FAD, a powerful and simple database language. In Proc. Intl. Conf. on Very Large Data Bases, pages 97--105, 1988.

....is not to define yet another map model, but to consider the major modeling features needed for handling geographic data efficiently. The complex object model we use is of great interest in this context although it does not consider object identity like other complex object models do (e.g. FAD [BBKV87] and all the true object oriented models) Nevertheless, we believe that this concept is not essential for what we want to show, namely simple geographic data modeling (i.e. data structuring and querying, and no update) In GIS, it is common to make the distinction between space based (or ....

....need second order tools (for describing functions of functions) Hence, when using this simple although powerful underlying model, operations must be described case by case, as we did above. We could have chosen other attractive base models in the domain of complex objects, as for instance FAD [BBKV87] In this approach, the user is provided with the possibility of defining the abstraction of functions and predicates, which allows to express anonymous functions (denoted by fun x y . which can be used in turn as argument to other functions. It is very similar to the lambda calculus ....

F. Bancilhon, T. Briggs, S. Khoshafian, and P. Valduriez. FAD, a Powerful and Simple Database Language. In Proc. Conf. on Very Large Data Bases (VLDB), Brighton, 1987. 28

....The query language, HDBL, is in the nested relational spirit, but includes explicit constructors for sets, tuples, and lists. Since there is no default, queries tend to become a little cumbersome. The ERC model of [85] the EER model of [42] the MAD model of [75, 76] the FAD language [9], the NST algebra [48] and the Algres system [24] the DBPL language [104] and the EXTRA model of [23] are other examples exhibiting the same query language characteristics: in the same way that type constructors can be nested, query languages have to provide nesting of expressions. Many of the ....

....the EXTRA model of [23] are other examples exhibiting the same query language characteristics: in the same way that type constructors can be nested, query languages have to provide nesting of expressions. Many of the complex object models included identifiers (reference attributes, surrogates) [94, 89, 88, 75, 9, 109, 23, 67] to support non hierarchical structures. Whereas hierarchical structures are directly represented by nesting, more general structures need some form of pointers . With the inclusion of references, the complex object models start becoming object oriented. If we take a closer look at many of the ....

F. Bancilhon, T. Briggs, S. Khoshafian, and P. Valduriez. FAD, a powerful and simple database language. In Proc. Int. Conf. on Very Large Databases, pages 97--105, Brighton, September 1987.

....Composition of Instruction. The composition of instruction ( is defined as the sequential application of instructions: U [ i 1 ; i 2 ] oe = U [ i 2 ] U [ i 1 ] oe Set oriented Application. The standard semantics for an iterator apply to all (also called filter, map, or replace [BBKV87, AB88] is the union of the operations applied to each element of the input set. In our case, this would be the union of the state transitions performed by applying instruction i to the initial state oe, for each element o of E[ set expr ] oe : U [ apply to all[i] o : set expr) oe = v ....

....the set of all persons names as follows: 1 map [name] P ersons) Notice that the above operations are algebra like extensions. Instead, COCOON can be brought closer to functional languages by introducing a more general set iterator (such as homu in Machiavelli [OBBT89, BO93] and pump in FAD [BBKV87] that need not necessarily return sets, but executes retrieval expressions similar to the apply to all iterator that executes updates in a set oriented way. 4.2.2 Tuples The inclusion of tuples in COCOON could, above all, be motivated by the following two objectives: ffl modeling n argument ....

F. Bancilhon, T. Briggs, S. Khoshafian, and P. Valduriez. FAD, a powerful and simple database language. In Proc. Int. Conf. on Very Large Databases, pages 97--105, Brighton, September 1987.

....an infinite set for ever; in semantic terms, the modified definition ensures that OE is continuous. Thus, as one might expect, we cannot use OE to devise terminating cardinality or summation functions for infinite sets. Others have defined similar functions to Phi e.g. the pump operator of FAD [Ban87] and the hom operator of Machiavelli [Oho89] and [Bre91] gives a comparison of these. We can now use OE to define a membership operator over possibly infinite sets: x in s = OE ( x) False s Thus, in returns T rue if any comparison of x with an element of s returns T rue, F alse if all ....

Bancilhon, F. et al. FAD, a powerful and simple database language, Proc. 13th VLDB Conference, 1991.

....relations dcr can always be expressed through bounded dcr (Section 3) We believe that these results are of interest from two angles. Query language design. dcr is a well known construct. It appears under the name pump, in a language specifically designed for a parallel database machine, FAD [BBKV87]. Following FAD, but under the name hom, this construct was included in Machiavelli [OBB89] where it fit nicely into the language s type system. Called (a form of) transducer, it is part of SVP [PSV92] precisely in order to support divide and conquer parallelism. Some limitations of its ....

F. Bancilhon, T. Briggs, S. Khoshafian, and P. Valduriez. FAD, a powerful and simple database language. In Proceedings of 13th International Conference on Very Large Data Bases, pages 97-- 105, 1987.

....data models no type information is kept. Objects can be freely created using the built in type constructors. This approach is typically termed loose typing. This typing strategy has its roots in the programming language LISP; one representative data model adhering to this typing philosophy is FAD [2]. ffl The dynamically typed models let the database designer specify the outer level of the objects; but the components (attributes, set elements, etc. are untyped, i.e. they may refer to any object. The precursor of this approach in the programming language area is Smalltalk 80 [8] which gave ....

F. Bancilhon, T. Briggs, S. Khoshafian, and P. Valduriez. FAD, a powerful and simple database language. In Proc. of The Conf. on Very Large Data Bases (VLDB), pages 97--105, Brighton, U.K., Sep 1987.

.... on the Bird Meertens formalism on lists suggests that such a style is remarkably expressive (see Bird [21, 22] Meertens [143] and Bird and Wadler [23] Programming with sets works out the same way (see Codd [41] Ohori, Buneman, and Tannen [153] and Bancilhon, Briggs, Khoshafian, and Valduriez [15]) A significant idea in the above work is that they identified certain simple forms of recursion and advocated programming in these restricted forms. One such simple form of recursion is structural recursion, which I now present based on the work of Tannen and Subrahmanyam [28] and Tannen, ....

F. Bancilhon, T. Briggs, S. Khoshafian, and P. Valduriez. A powerful and simple database language. In Proceedings of International Conference on Very Large Data Bases, pages 97--105, 1988.

....language which lacks the functionality of database systems. GEMSTONE [CM84, BMO 89] is a prototype system which added database features to Smalltalk making it one of the first OODBMSs. Other contributions come from ORION [BCG 87, KBC 89, KGBW90] EXODUS [CDF 88, CDV88] FAD [BBKV87] LOGRES ALGRES [CCCR 90] CACTIS [Hud86] CLASSIC [BBMR89] and EMERALD [BHJ 87] One unconventional approach which has generated ideas about object existence and reference is the formal model proposal by Wand [Wan89] which uses the philosophy of ontology [Bun77, Bun79] in defining the ....

F. Bancilhon, T. Briggs, S. Khoshafian, and P. Valduriez. FAD, a Powerful and Simple Database Language. In Proc. 13th Int'l Conf. on Very Large Databases, pages 97--105, Brighton, England, September 1987.

....completeness, of list comprehensions is proved. Database and programming language theories are further integrated by describing the relational calculus in a programming language semantics. 8. 1 Introduction There is a great deal of interest in unifying databases with programming languages [1, 2, 7, 12]. Any database programming language must incorporate a query notation. Any well integrated database programming language must have a consistent theoretical basis. The work described in this Chapter contributes towards unifying database and programming language theory. The database theory used is ....

Bancilhon F. Briggs T. Khosafian S. Valduriez P. FAD, A Powerful and Simple Database Language. Proceedings of the 13th International Conference on Very Large Databases, Brighton, England (September 1987), 97-107.

....for guaranteed processor balance. But as the number of nodes grows beyond some threshold, the cost of the control messages exceeds the total communication cost, making communications too expensive. Still, by increasing the size of the data sets, the threshold increases too. Bancilhon et al. BBKV87] describe a database language FAD, designed for a parallel database machine Bubba. FAD is a functional language, featuring nested sets with object identifiers (no bags or sequences) and two main parallel constructs: a parallel map (called filter) and a parallel divide and conquer construct ....

F. Bancilhon, T. Briggs, S. Khoshafian, and P. Valduriez. FAD, a powerful and simple database language. In Proceedings of 13th International Conference on Very Large Data Bases, pages 97--105, 1987.

No context found.

F. Bancilhon, et al. FAD, a powerful and simple database language. In VLDB , 97--105. 1987.

No context found.

F. Bancilhon, T. Briggs, S. Khoshafian, and P. Valduriez. A powerful and simple database language. In Proceedings of International Conference on Very Large Data Bases, pages 97--105, 1988.

No context found.

F. Bancilhon, T. Briggs, S. Khoshafian, and P. Valduriez. FAD, a powerful and simple database language. In VLDB, 1987.

No context found.

F. Bancilhon, T. Briggs, S. Khoshafian, and P. Valduriez 'FAD, a powerful and simple database language', Proc. of the 13th VLDB Conference, Brighton, 1987, pp. 97-105.

No context found.

Bancilhon, F. Briggs, T. Khoshafian, S. and Valduriez, P. FAD, a powerful and simple database language, Proc. 13th VLDB, Brighton, September 1987. pp 97-106. 28

First 50 documents

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