Fast algorithms for a class of temporal range queries.

DOI10.1007/B11837MaRDI QIDQ5900745zbMATH OpenFDO

Authors Qingmin Shi, Joseph Ja'Ja'

Publication date 20 April 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/B11837

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• A new framework for addressing temporal range queries and some preliminary results
• Algorithms and Computation
• scientific article; zbMATH DE number 2086277
• Study and application of temporal index technology
• Indexing moving points

Cited in

(14)

• A new framework for addressing temporal range queries and some preliminary results
• Temporal and spatio-temporal aggregations over data streams using multiple time granularities.
• A faster parameterized algorithm for temporal matching
• A data structure for efficiently managing a set of energy functions
• Study and application of temporal index technology
• Range selection and predecessor queries in data aware space and time
• An efficient method for temporal aggregation with range-condition attributes
• Fast sequential and parallel algorithms for finding extremal sets
• scientific article; zbMATH DE number 2086277 (Why is no real title available?)
• On the performance and cost of some PRAM models on CMP hardware
• A Quadtree-Based Dynamic Attribute Indexing Method
• scientific article; zbMATH DE number 1953129 (Why is no real title available?)
• scientific article; zbMATH DE number 1830721 (Why is no real title available?)
• Algorithms and Computation

This page was built for publication: Fast algorithms for a class of temporal range queries.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900745)