34
Views
0
CrossRef citations to date
0
Altmetric
Section A

Error analysis for superimposed random coding

Pages 1373-1386 | Received 13 Aug 2008, Accepted 08 Jun 2010, Published online: 06 Feb 2011

References

  • Antoshenkov , G. and Ziauddin , M. 1996 . Query processing and optimization in Oracle Rdb . VLDB J , 5 ( 4 ) : 229 – 237 . Available at http://dx.doi.org/10.1007/s007780050026
  • Barnard , J. M. 1993 . Substructure searching methods: Old and new . J. Chem. Inf. Comput. Sci. , 33 : 532 – 538 .
  • Barnard , J. M. and Walkowiak , D. 1998 . “ Computer systems for substructure searching ” . In The Beilstein System – Strategies for Effective Searching , Edited by: Heller , S. R. 55 – 72 . Washington, DC : American Chemical Society .
  • Bloom , B. H. 1970 . Space/time trade-offs in hash coding with allowable errors . Commun. Assoc. Comput. Mach. , 13 ( 7 ) : 422 – 426 .
  • Broder , A. and Mitzenmacher , M. 2002 . Network applications of bloom filters: A survey . Internet Math. , 1 : 636 – 646 . Available at http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.98
  • Faloutsos , C. 1985 . Access methods for text . ACM Comput. Surv. , 17 ( 1 ) : 49 – 74 . Available at http://doi.acm.org/10.1145/4078.4080
  • Faloutsos , C. Signature files: design and performance comparison of some signature extraction methods . SIGMOD ’85: Proceedings of the 1985 ACM SIGMOD International Conference on Management of Data . May 28–31 1985 , Austin, Texas. Edited by: Navathe , S. B. pp. 63 – 82 . New York, NY : ACM Press . Available at http://doi.acm.org/10.1145/318898.318903
  • Günther , B. 2008 . On the probability distribution of superimposed random codes . IEEE Trans. Inform. Theory , 54 ( 7 ) : 3206 – 3210 . DOI 10.1109/TIT.2008.924658
  • Günther , B. 2010 . The superposition Markov chain: Finite occupancy with coupling and the asymptotics thereof . Probab. Math. Statist. , 30 ( 1 ) : 103 – 120 .
  • Helmer , S. and Moerkotte , G. 2003 . A performance study of four index structures for set-valued attributes of low cardinality . VLDB J , 12 ( 3 ) : 244 – 261 . Available at http://dx.doi.org/10.1007/s00778-003-0106-0
  • Kautz , W. H. and Singleton , R. C. 1964 . Nonrandom binary superimposed codes . IEEE Trans. Inform. Theory , 10 ( 4 ) : 363 – 377 .
  • Knuth , D. E. 1998 . “ The Art of Computer Programming – Sorting and Searching ” . In , 2 , Vol. 3 , Reading, MA : Addison–Wesley .
  • V.F. Kolchin, B.A. Sevast'yanov, and V.P. Chistyakov, Random Allocations, Scripta Series in Mathematics, XI, Washington: Winston Sons [distrib. by New York, Toronto, London: Halsted Press (John Wiley & Sons)], 1978, XI, 262 p
  • Markoff , A. A. 1912 . “ Wahrscheinlichkeitsrechnung ” . Leipzig : Teubner .
  • Moffat , A. and Zobel , J. 2006 . Inverted files for text search engines . ACM Comput. Surv. , 38 ( 2 ) Article no. 6. Available at http://doi.acm.org/10.1145/1132956.1132959
  • C.N. Mooers, Application of random codes to the gathering of statistical information, Masters thesis, Massachusetts Institute of Technology, 1948
  • Rashad , A. M. 1990 . Superimposed codes for the search model of A. Renyi . Int. J. Comput. Math. , 36 : 47 – 56 .
  • Roberts , C. S. 1979 . Partial-match retrieval via the method of superimposed codes . Proc. IEEE , 67 ( 12 ) : 1624 – 1642 .
  • Stiassny , S. 1960 . Mathematical analysis of various superimposed coding methods . Am. Docum. , 11 ( 2 ) : 155 – 169 . Available at http://dx.doi.org/10.1002/asi.5090110209
  • Wu , K. , Otoo , E. J. and Shoshani , A. Compressing bitmap indexes for faster search operations . SSDBM ’02: Proceedings of the 14th International Conference on Scientific and Statistical Database Management, IEEE Computer Society . pp. 99 – 108 . Available at http://dx.doi.org/10.1109/SSDM
  • Zobel , J. and Moffat , A. 1996 . Self-indexing inverted files for fast text retrieval . ACM Trans. Inf. Syst. , 14 ( 4 ) : 349 – 379 . Available at http://doi.acm.org/10.1145/237496.237497
  • Zobel , J. , Moffat , A. and Ramamohanarao , K. 1998 . Inverted files versus signature files for text indexing . ACM Trans. Database Syst. , 23 ( 4 ) : 453 – 490 . Available at http://doi.acm.org/10.1145/296854.277632

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.