R. Beigel and Egemen Tanin. The geometry of browsing. In Proceedings of the Latin Ameriacn symposium on Theoretical Informatics,1998. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Multiscale Histograms: Summarizing Topological - Relations In Large (Correct)
....of a huge collection of on line spatial data, there are strong demands for e#ective techniques to support e# cient browsing of large datasets to summarise spatial characteristics. It becomes extremely important in large digital libraries archives to support interactive queries by query preview [3, 9]. These applications require a system to provide a fast summary information to users for quickly identifying relevant data among enormous available data resources. Summarizing spatial datasets also plays an important role in spatial query processing optimization by providing selectivity estimation ....
....SQ histogram technique in [1] belong to the first category, and propose to group similar objects together according to some mathematic models to form a bucket for estimating the number of disjoint objects and the number of non disjoint objects in window queries. Techniques based on cell density [3, 14, 20] propose to divide the object space into a number of disjoint cells, and to record some kind of object density for each cell. To estimate the number of non disjoint objects against a window, a cumulative density based approach (CD) was proposed in [14] while the Euler formula [11] has been ....
[Article contains additional citation context not shown here]
R. Beigel and Egemen Tanin. The geometry of browsing. In Proceedings of the Latin Ameriacn symposium on Theoretical Informatics,1998.
The ADEPT Digital Library Architecture - Janée, Frew (2002) (1 citation) (Correct)
....individual collections. Thus a client can formulate a single query that can be used to, in effectively one step, both identify relevant collections and subsequently search for items within those collections. 5. 3 Scalability Evaluating a query region against an Euler histogram takes constant time [1]. The histograms and item counts amount to only a few kilobytes per collection, and thus can all be stored in primary memory. We therefore anticipate that the CDS can easily accommodate tens of thousands of collections, and answer queries with reasonable speed, without having to resort to more ....
Beigel, R. and Tanin, E., The geometry of browsing. in Latin American Symposium on Theoretical Informatics, (Brazil, 1998), 331-340.
Exploring Spatial Datasets with Histograms - Sun, Agrawal, Abbadi (2001) (7 citations) (Correct)
....into tiles, and send out the queries for all the tiles with a single command. There are certain aspects of a browsing system that have been studied in prior research. The HumanComputer Interaction Laboratory at University of Maryland at College Park (HCIL UMD) has been working on similar systems [4, 5] since 1996 with an emphasis on user interfaces. The query processing part of a browsing system, which returns the size of a result set rather than the actual objects, is closely related to the work in the areas of range query aggregation and range query selectivity estimation. However, spatial ....
....service. Another area of research that is closely related to the browsing applications considered in this paper is spatial range query selectivity estimation [11, 12, 13] We will discuss one of these algorithms, the Cumulative Density algorithm [13] together with Beigel Tanin s algorithm [5] in more details in Section 3. These algorithms are designed to handle range objects, and are usually very ecient in both storage space and query response time. However, these algorithms only distinguish between two types of spatial relations: disjoint and intersect, while spatial database users ....
[Article contains additional citation context not shown here]
R. Beigel and Egemen Tanin. The geometry of browsing. In Proceedings of the Latin American Symposium on Theoretical Informatics, 1998.
Selectivity Estimation for Spatial Joins with Geometric.. - Sun, Agrawal, Abbadi (2002) (6 citations) (Correct)
....gives accurate selectivity estimation for SJGS queries. Our contributions are as follows: ffl We demonstrate the use of Euler Histogram to solve a special case of SJGS queries. Euler histograms are powerful histograms that were previously used in selectivity estimation for spatial intersection [BT98] and containment [SAE01] queries. ffl We generalize Euler Histogram to serve as a framework for selectivity estimation for common types of SJGS queries. The framework is capable of accommodating different probabilistic models for datasets with different characteristics. ffl We incorporate two ....
....in each sub histogram. Euler Histogram for Spatial Dataset Browsing. Browsing is closely related to selectivity estimation, where a user is interested in visualizing the data distribution of a dataset without accessing the actual data. Euler Histograms were first introduced by Beigel and Tanin in [BT98] for browsing all objects in a spatial dataset that intersect a selected region. SAE01] extends the work to spatial relations including contains, contained and overlap. The mathematical foundation of the Euler Histogram is based on Euler s Formula in graph theory, hence the name Euler Histogram. ....
[Article contains additional citation context not shown here]
R. Beigel and Egemen Tanin. The geometry of browsing. In Proceedings of the Latin American Symposium on Theoretical Informatics,
Efficient Multi-Object Dynamic Query Histograms - Derthick, Harrison, Moore, Roth (1999) (2 citations) (Correct)
....counts. We then show how to use a randomized set cardinality representation that uses only O(log r) storage and with high probability gives an accurate estimate. As an aside, Query Previews encountered a similar overcounting problem due to overlapping attribute values in their geographical domain [8]. For instance data from North Africa and Libya overlaps at every grid point in Libya. They describe a deterministic solution that relies on the fact that the areas of overlap are contiguous, so it does not apply here. Ioannidis [9] suggests an approach that gives exact counts in the case ....
R. Beigel and E. Tanin, "The Geometry of Browsing," presented at Latin American theoretical informatics (LATIN), 1998, p. 331-340.
Multiscale Histograms: Summarizing Topological - Relations In Large (2003) (Correct)
No context found.
R. Beigel and Egemen Tanin. The geometry of browsing. In Proceedings of the Latin Ameriacn symposium on Theoretical Informatics,1998.
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