N. Roussopoulos, D. Leifker, An introduction to PSQL: A pictorial structured query language, IEEE Workshop on Visual Language, Hiroshima, Japan, pp. 77-84, 1984. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Separability of Polyhedra for Optimal Filtering of.. - Brodsky, Lassez.. (1995) (11 citations) (Correct)
....Many efficient indexing strategies have been developed for objects that are represented by a (multidimensional) interval. This includes priority search trees [McC] which have optimal worst case bounds for (1 dimensional) intervals, optimal interval index in secondary storage [KRVV93] R trees [Gut84, RL84, RL85], R trees [SRF87] R trees [BKSS90] for 2 dimensional intervals (i.e. rectangles) P trees [J90] which extend Rtrees to higher dimensions, and indices based on combination of interval and range trees [Ed83, SiW82] To facilitate the above indexing structures for arbitrary objects, the idea ....
N. Roussopoulos, D. Leifker, An introduction to PSQL: A pictorial structured query language, IEEE Workshop on Visual Language, Hiroshima, Japan, pp. 77-84, 1984.
VCME: A Visual Interactive Environment for Computational .. - Chen, Smith, Wang, Saran (Correct)
....scientific modeling activities. Finally, the third category pertains to mechanisms and tools that provide access to distributed resources. The class of visual languages [3, 4] includes languages for handling visual information, such as GRAIN [5] for supporting visual interaction, such as PSQL [6] and ICDL [7] and HI VISUAL [8] for programming with visual expressions, including data flow diagram languages that provide views of a computation in terms of the flow of data from one filter to another, such as LabVIEW [9] for science and PROGRAPH [10] for general purpose; and for dealing with ....
N. Roussopoulos and D. Leifker (1984) An Introduction to PSQL: A Pictorial Structured Query Language, Proceeding of the 1984 IEEE Computer Society Workshop on Visual Languages, Hiroshima, Japan, 77-87.
Separability of Polyhedra and a New Approach to Spatial.. - Brodsky, Lassez (10 citations) (Correct)
.... access structure manages only pairs of intervals, and not the objects themselves, there is a clear separation between the complexity of the object geometry and the complexity of the search (access methods) Ni90] Third, efficient access methods for rectangles (pairs of intervals) such as R trees [Gut84, RL84, RL85], R trees [SRF87] R trees [BKSS90] or based on combination of interval and range trees [Ed83, SiW82] have been developed. The latter structure, for example, has a worst case time bound of O(log 2 n k) for search, where n is the total number of rectangles and k is the number of ....
N. Roussopoulos, D. Leifker, An introduction to PSQL: A pictorial structured query language, IEEE Workshop on Visual Language, Hiroshima, Japan, pp. 7784, 1984.
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