Filtering Search: A New Approach to Query-Answering
From MaRDI portal
(Redirected from Publication:3753527)
Recommendations
Cited in
(79)- Random access in persistent strings and segment selection
- Linear-space data structures for range frequency queries on arrays and trees
- An algorithm for handling many relational calculus queries efficiently.
- Optimal external memory planar point enclosure
- The new \(k\)-windows algorithm for improving the \(k\)-means clustering algorithm
- Efficient dynamic algorithms for some geometric intersection problems
- Improved pointer machine and I/O lower bounds for simplex range reporting and related problems
- Dictionary matching with uneven gaps
- Efficient searching with linear constraints
- Space efficient dynamic orthogonal range reporting
- Point enclosure problem for homothetic polygons
- INTERSECTION PROBLEMS ON SEGMENTS UNDER BOUNDARY UPDATES WITH APPLICATION TO PERSISTENT LISTS
- A framework for 1-D compaction with forbidden region avoidance
- Point enclosure problem for homothetic polygons
- Data structures for range-aggregation over categories
- An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ3
- OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS
- Two- and three- dimensional point location in rectangular subdivisions
- A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency
- Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions
- Dynamic orthogonal range queries in OLAP.
- Aggregate-\textsc{Max} top-\(k\) nearest neighbor searching in the \(L_{1}\) plane
- Finding pairwise intersections inside a query range
- Optimal deterministic shallow cuttings for 3-d dominance ranges
- Lower bounds for intersection searching and fractional cascading in higher dimension
- The intersection searching problem for c-oriented polygons
- Linear space data structures for two types of range search
- Lower bounds on the complexity of simplex range reporting on a pointer machine (extended abstract)
- Reporting points in halfspaces
- Dominance for enclosure problems
- Substring range reporting
- Optimal window queries on line segments using the trapezoidal search DAG
- Orthogonal point location and rectangle stabbing queries in 3-d
- Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
- Worst case efficient single and multiple string matching in the RAM model
- Graphics in flatland revisited
- On the difficulty of range searching.
- A new framework for addressing temporal range queries and some preliminary results
- Visibility and intersection problems in plane geometry
- Making data structures persistent
- Further results on generalized intersection searching problems: Counting, reporting, and dynamization
- Simplex range reporting on a pointer machine
- Computing convolutions by reciprocal search
- Algorithms for generalized halfspace range searching and other intersection searching problems
- Consecutive occurrences with distance constraints
- Computing hereditary convex structures
- Twin-width. III: Max independent set, min dominating set, and coloring
- Algorithms for three-dimensional dominance searching in linear space.
- The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric
- Algorithms for generalized halfspace range searching and other intersection searching problems
- Graph problems arising from parameter identification of discrete dynamical systems
- Finding pairwise intersections of rectangles in a query rectangle
- Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
- Efficient non-intersection queries on aggregated geometric data
- FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING
- Finding pairwise intersections inside a query range
- Filtering search results using an optimal set of terms identified by an artificial neural network
- A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids
- Linear-space data structures for range minority query in arrays
- Range reporting for time series via rectangle stabbing
- Dominance for enclosure problems
- Approximating multiplicatively weighted Voronoi diagrams: efficient construction with linear size
- External memory fully persistent search trees
- Parallel fractional cascading on hypercube multiprocessors
- scientific article; zbMATH DE number 7765406 (Why is no real title available?)
- Orthogonal queries in segments
- Near-linear algorithms for geometric hitting sets and set covers
- Simplex Range Searching and Its Variants: A Review
- Obnoxious facility location: complete service with minimal harm
- Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings
- Finding pairwise intersections of rectangles in a query rectangle
- UNSUPERVISED CLUSTERING USING FRACTAL DIMENSION
- Substring Range Reporting
- Extending range queries and nearest neighbors
- Dictionary matching with a bounded gap in pattern or in text
- Incremental hive graph
- Consecutive occurrences with distance constraints
- Biased range trees
- Entropy-bounded representation of point grids
This page was built for publication: Filtering Search: A New Approach to Query-Answering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753527)
