The Community for Technology Leaders
Green Image
Issue No. 01 - January (2007 vol. 19)
ISSN: 1041-4347
pp: 73-84
Many applications require a randomized ordering of input data. Examples include algorithms for online aggregation, data mining, and various randomized algorithms. Most existing work seems to assume that accessing the records from a large database in a randomized order is not a difficult problem. However, it turns out to be extremely difficult in practice. Using existing methods, randomization is either extremely expensive at the front end (as data are loaded), or at the back end (as data are queried). This paper presents a simple file structure which supports both efficient, online random shuffling of a large database, as well as efficient online sampling or randomization of the database when it is queried. The key innovation of our method is the introduction of a small degree of carefully controlled, rigorously monitored nonrandomness into the file.
Sampling methods, database systems.

C. Jermaine, "Online Random Shuffling of Large Database Tables," in IEEE Transactions on Knowledge & Data Engineering, vol. 19, no. , pp. 73-84, 2007.
83 ms
(Ver 3.3 (11022016))