Filtering Search: A New Approach to Query-Answering
From MaRDI portal
Publication:3753527
DOI10.1137/0215051zbMath0612.68088OpenAlexW2136963423MaRDI QIDQ3753527
Publication date: 1986
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0215051
Related Items (72)
An algorithm for handling many relational calculus queries efficiently. ⋮ Optimal external memory planar point enclosure ⋮ Lower bounds for intersection searching and fractional cascading in higher dimension ⋮ Finding Pairwise Intersections Inside a Query Range ⋮ Computing convolutions by reciprocal search ⋮ The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric ⋮ Graphics in flatland revisited ⋮ Two- and three- dimensional point location in rectangular subdivisions ⋮ A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids ⋮ DATA STRUCTURES FOR RANGE-AGGREGATION OVER CATEGORIES ⋮ Further results on generalized intersection searching problems: Counting, reporting, and dynamization ⋮ Orthogonal queries in segments ⋮ A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency ⋮ Making data structures persistent ⋮ Simplex range reporting on a pointer machine ⋮ Algorithms for generalized halfspace range searching and other intersection searching problems ⋮ Finding pairwise intersections of rectangles in a query rectangle ⋮ Dictionary Matching with Uneven Gaps ⋮ Entropy-bounded representation of point grids ⋮ Aggregate-MAX Top-k Nearest Neighbor Searching in the L1 Plane ⋮ An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ3 ⋮ Incremental hive graph ⋮ Range queries on uncertain data ⋮ Dynamic orthogonal range queries in OLAP. ⋮ Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions ⋮ Unnamed Item ⋮ Optimal window queries on line segments using the trapezoidal search DAG ⋮ Biased range trees ⋮ Random access in persistent strings and segment selection ⋮ Point enclosure problem for homothetic polygons ⋮ Simplex Range Searching and Its Variants: A Review ⋮ Graph problems arising from parameter identification of discrete dynamical systems ⋮ Visibility and intersection problems in plane geometry ⋮ Dictionary matching with a bounded gap in pattern or in text ⋮ Unnamed Item ⋮ Worst-case efficient single and multiple string matching on packed texts in the word-RAM model ⋮ Efficient dynamic algorithms for some geometric intersection problems ⋮ OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM ⋮ Worst Case Efficient Single and Multiple String Matching in the RAM Model ⋮ Space efficient dynamic orthogonal range reporting ⋮ Linear-space data structures for range minority query in arrays ⋮ Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings ⋮ Substring Range Reporting ⋮ A framework for 1-D compaction with forbidden region avoidance ⋮ Parallel fractional cascading on hypercube multiprocessors ⋮ Reporting points in halfspaces ⋮ Substring range reporting ⋮ FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING ⋮ Optimal deterministic shallow cuttings for 3-d dominance ranges ⋮ Finding pairwise intersections inside a query range ⋮ String indexing for patterns with wildcards ⋮ Join-reachability problems in directed graphs ⋮ On the difficulty of range searching. ⋮ Computing hereditary convex structures ⋮ A new framework for addressing temporal range queries and some preliminary results ⋮ UNSUPERVISED CLUSTERING USING FRACTAL DIMENSION ⋮ INTERSECTION PROBLEMS ON SEGMENTS UNDER BOUNDARY UPDATES WITH APPLICATION TO PERSISTENT LISTS ⋮ Linear space data structures for two types of range search ⋮ Lower bounds on the complexity of simplex range reporting on a pointer machine ⋮ Near-linear algorithms for geometric hitting sets and set covers ⋮ The intersection searching problem for c-oriented polygons ⋮ Unnamed Item ⋮ EFFICIENT NON-INTERSECTION QUERIES ON AGGREGATED GEOMETRIC DATA ⋮ Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines ⋮ Extending range queries and nearest neighbors ⋮ Algorithms for generalized halfspace range searching and other intersection searching problems ⋮ Efficient searching with linear constraints ⋮ Algorithms for three-dimensional dominance searching in linear space. ⋮ OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS ⋮ The new \(k\)-windows algorithm for improving the \(k\)-means clustering algorithm ⋮ IMPROVED POINTER MACHINE AND I/O LOWER BOUNDS FOR SIMPLEX RANGE REPORTING AND RELATED PROBLEMS ⋮ Linear-space data structures for range frequency queries on arrays and trees
This page was built for publication: Filtering Search: A New Approach to Query-Answering
