Skip to main content
SpringerLink
Log in

Sampling algorithms for differential batch retrieval problems (extended abstract)

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1984)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 172))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Astrahan, et al., ACM's TODS 1(1976), 97–137.

    Google Scholar 

  2. Aho & Ullman, ACM's TODS, 4(1979), 435–454.

    Google Scholar 

  3. Bickel & Doksum, Mathematical Statistics, Basic Ideas and Topics, 1977.

    Google Scholar 

  4. Bentley, CACM 23(1980), 214–228.

    Google Scholar 

  5. Batore & Gottlieb, ACM's TODS, 7(1982), 509–540.

    Google Scholar 

  6. Birnbaum, Introduction to Probability and Mathematical Statistics, 1962.

    Google Scholar 

  7. Bechover, Kiefer & Sobel, Sequential Ident. & Ranking Procedures, 1968.

    Google Scholar 

  8. Bolour, JACM, 26(1979), 196–210.

    Google Scholar 

  9. Bentley & Shamos, 15-th Allerton Conf. (1977), 193–201.

    Google Scholar 

  10. Bentley & Saxe, J.Alg. 1(1980), 301–358.

    Google Scholar 

  11. Cochran, Sampling Algorithms, John Wiley Sons, New York, 1977.

    Google Scholar 

  12. DeGroot, Optimal Statistical Decisions, McGraw Hill Inc., N.Y., 1970.

    Google Scholar 

  13. Dalal & Srinivasan, Mangement S. 23(1977), 1284–1294.

    Google Scholar 

  14. Edelsbrenner & Overmars, "Batch Solutions ..." 1983, U. Utrecht RUU-CS-83-8.

    Google Scholar 

  15. Feller, Introduction to Probability Theory and Its Applications, v.1, 1968.

    Google Scholar 

  16. Floyd & Rivest, CACM 18(1975), 165–172.

    Google Scholar 

  17. Fredman, JACM 28(1981), 696–706.

    Google Scholar 

  18. Guptat Huang, Lecture Notes in Statistics, 1981.

    Google Scholar 

  19. Gibbons, Olkin & Sobel, Selecting & Ordering Popul., 1977.

    Google Scholar 

  20. Gonnet et al., Acta Inf., 13(1), 1980, 39–52.

    Google Scholar 

  21. Gottlieb, 1975 ACM SIGMOD Conference.

    Google Scholar 

  22. Hannai, CACM, 20(1977), 344–347.

    Google Scholar 

  23. Kerschberg et al., ACM's TODS 7(1982), 678–712.

    Google Scholar 

  24. Lee & Wong, ACM's TODS, 5(1980), 339–347.

    Google Scholar 

  25. Overmars & von Leeuvwen, Acta Inf. 17(1982), 267–286.

    Google Scholar 

  26. Paige & Koenig, ACM's TOPL, 1982, 402–454.

    Google Scholar 

  27. Pearl & Reingold, IPL, 6(1977), 219–222.

    Google Scholar 

  28. Pearl, Itai & Avni, CACM 21(7), 1978, 550–554.

    Google Scholar 

  29. Ullman, Principles of Database Systems, Computer Science Press, 1982.

    Google Scholar 

  30. Wiederhold, Database Design, McGraw Hill, New York, 1982.

    Google Scholar 

  31. Willard, Predicate-Oriented Database Search Algorithms, Ph.D. Thesis, Harvard University, 1978. Also in Outstanding Dissertations in Computer Science, Garland Publishing, New York, 1979. The Garland copies are priced as hard-cover books; you can save money by asking your librarian to purchase a copy.

    Google Scholar 

  32. —, "New Data Structure for Orthogonal Queries," first draft was Harvard TR-22-78 (1978), second draft in 1982 Allerton Conference, third draft to appear in SIAM J. Comp, Feb. or May, 1985.

    Google Scholar 

  33. —, "Searching Nonuniformly Generated Files in Log Log N Runtime," extended abstract in Proc. of the ORSA-TMS Conf. on Applied Probability — Computer Science Interface, 1981; full length paper to appear in SIAM J. Comp.

    Google Scholar 

  34. —, 21-st Allerton Conf. on Comm. Contr. and Comp., 1983, 663–675.

    Google Scholar 

  35. —, "Predicate Retrieval Theory," SUNY Albany, TR 83-3, Aug., 1983.

    Google Scholar 

  36. —, 21-st Allerton Conf. on Comm. Contr. and Comp., 1983, 656–662.

    Google Scholar 

  37. —, Inf. Proc. Lett., 24(1983), 81–84.

    Google Scholar 

  38. —, paper on relational calculus, at ACM's 1984 SIGMOD Conference.

    Google Scholar 

  39. —, JCSS, June 1984.

    Google Scholar 

  40. —, ACM 1984 Symp. on Theory of Comp.

    Google Scholar 

  41. Willard & Lueker, "Adding Range Restriction Capability to Dynamic Data Structures," to appear in Journal of ACM.

    Google Scholar 

  42. Yao & Yao, 17th IEEE FOCS, 1976, 173–177.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SUNY Albany Campus, 12222, Albany, New York

    Dan E. Willard (consultant to Bell Communications Research)

Authors
  1. Dan E. Willard
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Paredaens

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Willard, D.E. (1984). Sampling algorithms for differential batch retrieval problems (extended abstract). In: Paredaens, J. (eds) Automata, Languages and Programming. ICALP 1984. Lecture Notes in Computer Science, vol 172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13345-3_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-13345-3_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13345-2

  • Online ISBN: 978-3-540-38886-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation