Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects
نویسندگان
چکیده
منابع مشابه
Scheduling Intersection Queries in Term Partitioned Inverted Files
This paper proposes and presents a comparison of scheduling algorithms applied to the context of load balancing the query traffic on distributed inverted files. We put emphasis on queries requiring intersection of posting lists, which is a very demanding case for the term partitioned inverted file and a case in which the document partitioned inverted file used by current search engines can perf...
متن کاملA Cost Model for Spatial Intersection Queries on RI-Trees
The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree), an efficient access method has been proposed to process intersection queries of spatial objects encoded by interval sequences on top of existing object-relational database systems. This paper complements that approach by e...
متن کاملStabbing Segments with Rectilinear Objects
Given a set S of n line segments in the plane, we say that a region R ⊆ R is a stabber for S ifR contains exactly one endpoint of each segment of S. In this paper we provide optimal or near-optimal algorithms for reporting all combinatorially different stabbers for several shapes of stabbers. Specifically, we consider the case in which the stabber can be described as the intersection of axis-pa...
متن کاملOptimal k-Constraint Coverage Queries on Spatial Objects
Given a set of spatial objects, our task is to assign all the objects to the minimum number of service sites and to find the regions for building these service sites. Each service site has a coverage region (i.e., an area of service) and a capacity (i.e., a maximum number of objects it can serve, called k-constraint). The service sites can provide service for objects located within the coverage...
متن کاملStabbing Orthogonal Objects in 3-Space
David M. Mount Fan-Tao Pu Department of Computer Science University of Maryland College Park, MD 20742 fmount,[email protected] 1 Motivation Computer graphics is the source of many interesting and challenging applications for the design of geometric algorithms and data structures. Applications in global illumination simulation and radiosity [7] have motivated our study of problems involving line...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1993
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/36.2.107