K. Kato, T. Masuda, and Y. Kiyoki. A comprehension-based database language and its distributed execution. In Proc. IEEE Tenth Int. Conf. on Distributed Computing Systems, pages 442--449, Paris, May 1990. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Object-Oriented Query Language Design and Processing - Chan (1994) (Correct)
.... language is evaluated on a dataflow multiprocessor and uses parallel list comprehensions to process database queries at speeds comparable with other multiprocessor database machines [NH91] SPL is a language that uses comprehensions to evaluate queries in parallel over a distributed database [KMK90] The new version of Napier [MBCD89] about to be released supports collection comprehensions. 4.1.3 Simplicity, Power Optimisation It was argued in [Tri91] that comprehensions are a good query notation for being concise, clear, expressive, and easily optimised. The essence of the argument is ....
K. Kato, K. Masuda, and Y. Kiyoki. A Comprehension-based Database Language and its Distributed Execution. In Proceedings of Distributed Computer System, 1990.
Comprehensions, a Query Notation for DBPLs - Trinder (1990) (23 citations) (Correct)
....and efficiency of the DBPL. Hence the following arguments for the brevity, clarity and efficiency are made for comprehensions expressing queries requiring no more power than the relational calculus. Although most existing DBPLs are sequential there are a few concurrent or distributed DBPLs [14, 15, 21]. Hence it is desirable, but not essential that a query notation should be easily made concurrent. The AGNA DBPL is evaluated on a dataflow multiprocessor and uses parallel list comprehensions to process database queries at speeds comparable with other multiprocessor database machines [21] SPL is ....
.... The AGNA DBPL is evaluated on a dataflow multiprocessor and uses parallel list comprehensions to process database queries at speeds comparable with other multiprocessor database machines [21] SPL is a language that uses comprehensions to evaluate queries in parallel over a distributed database [14]. It is not clear that the results reported here hold for AGNA and SPL comprehensions as both are non standard: AGNA uses open lists and SPL comprehensions are elaborated to increase efficiency and include communication primitives. 3.1 Brevity Comprehension queries are brief because they are a ....
Kato K. Masuda T. Kiyoki Y. A Comprehension-based Database Language and its Distributed Execution. Proceedings of Distributed Computer Systems (1990).
Persistent Caching: An Implementation Technique for Complex.. - Kato, MASUDA (1992) (5 citations) Self-citation (Kato Masuda) (Correct)
.... set, and list) and operators to represent and manipulate complex objects [5, 29] using the abstract data type concept exploited in programming languages [36, 7, 30] using object oriented paradigms [26, 15, 3] and bringing persistency and a data managing capabilityinto programming languages [4, 6, 19]. A notable feature of these newer approaches is that they enable explicit and natural representation of logical relationships among complex objects, more than conventional approaches suchas the hierarchical, network, and relational data models. Many of the newer approaches support a concept of ....
K. Kato, T. Masuda, and Y. Kiyoki. A comprehension-based database language and its distributed execution. In Proc. IEEE Tenth Int. Conf. on Distributed Computing Systems, pages 442--449, Paris, May 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