The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Implementations for coalesced hashing
Communications of the ACM
Steady-state simulation of queueing processes: survey of problems and solutions
ACM Computing Surveys (CSUR)
Using lifetime predictors to improve memory allocation performance
PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Evaluating models of memory allocation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
WSC '95 Proceedings of the 27th conference on Winter simulation
Improved histograms for selectivity estimation of range predicates
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Approximate medians and other quantiles in one pass and with limited memory
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Minimum cost adaptive synchronization: experiments with the ParaSol system
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on Web-based modeling and simulation
Simulation-based estimation of quantiles
Proceedings of the 31st conference on Winter simulation: Simulation---a bridge to the future - Volume 1
A performance comparison of the window systems of two LISP machines (abstract)
CSC '86 Proceedings of the 1986 ACM fourteenth annual conference on Computer science
Space-efficient online computation of quantile summaries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
A One-Pass Algorithm for Accurately Estimating Quantiles for Disk-Resident Data
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Querying and Clustering Very Large Data Sets Using Dynamic Bucketing Approach
WAIM '02 Proceedings of the Third International Conference on Advances in Web-Age Information Management
Benchmarking Models and Tools for Distributed Web-Server Systems
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
Evaluating holistic aggregators efficiently for very large datasets
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the 35th conference on Winter simulation: driving innovation
Domain-Driven Data Synopses for Dynamic Quantiles
IEEE Transactions on Knowledge and Data Engineering
Cycle-time quantile estimation in manufacturing systems employing dispatching rules
WSC '05 Proceedings of the 37th conference on Winter simulation
Indirect cycle-time quantile estimation for non-FIFO dispatching policies
Proceedings of the 38th conference on Winter simulation
How to summarize the universe: dynamic maintenance of quantiles
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
An efficient algorithm for approximate biased quantile computation in data streams
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
An overview of the OMNeT++ simulation environment
Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops
Securely computing an approximate median in wireless sensor networks
Proceedings of the 4th international conference on Security and privacy in communication netowrks
The modeling power of CINSim: Performance evaluation of interconnection networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Secure median computation in wireless sensor networks
Ad Hoc Networks
A Streaming Parallel Decision Tree Algorithm
The Journal of Machine Learning Research
Handling numeric attributes in hoeffding trees
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
An Ω(1/ε log 1/ε) space lower bound for finding ε-approximate quantiles in a data stream
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Do mean-based ranking and selection procedures consider systems' risk?
Winter Simulation Conference
Pesto: online storage performance management in virtualized datacenters
Proceedings of the 2nd ACM Symposium on Cloud Computing
Deterministic splitter finding in a stream with constant storage and guarantees
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Layered spatio-temporal forests for left ventricle segmentation from 4d cardiac MRI data
STACOM'11 Proceedings of the Second international conference on Statistical Atlases and Computational Models of the Heart: imaging and modelling challenges
Taming uncertainties in real-time routing for wireless networked sensing and control
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
A new perspective on batched quantile estimation
Proceedings of the Winter Simulation Conference
| Hi-index | 48.22 |
A heuristic algorithm is proposed for dynamic calculation of the median and other quantiles. The estimates are produced dynamically as the observations are generated. The observations are not stored; therefore, the algorithm has a very small and fixed storage requirement regardless of the number of observations. This makes it ideal for implementing in a quantile chip that can be used in industrial controllers and recorders. The algorithm is further extended to histogram plotting. The accuracy of the algorithm is analyzed.