Sampling algorithms for differential batch retrieval problems (extended abstract)

  • Dan E. Willard
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 172)


Assignment Procedure Partial Analog Query State Optimal Sample Size Sampling Cost 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [As76]
    Astrahan, et al., ACM's TODS 1(1976), 97–137.Google Scholar
  2. [AU79]
    Aho & Ullman, ACM's TODS, 4(1979), 435–454.Google Scholar
  3. [BD77]
    Bickel & Doksum, Mathematical Statistics, Basic Ideas and Topics, 1977.Google Scholar
  4. [Be80]
    Bentley, CACM 23(1980), 214–228.Google Scholar
  5. [BG83]
    Batore & Gottlieb, ACM's TODS, 7(1982), 509–540.Google Scholar
  6. [Bi62]
    Birnbaum, Introduction to Probability and Mathematical Statistics, 1962.Google Scholar
  7. [BKS68]
    Bechover, Kiefer & Sobel, Sequential Ident. & Ranking Procedures, 1968.Google Scholar
  8. [Bo79]
    Bolour, JACM, 26(1979), 196–210.Google Scholar
  9. [BS77]
    Bentley & Shamos, 15-th Allerton Conf. (1977), 193–201.Google Scholar
  10. [BS80]
    Bentley & Saxe, J.Alg. 1(1980), 301–358.Google Scholar
  11. [Co77]
    Cochran, Sampling Algorithms, John Wiley Sons, New York, 1977.Google Scholar
  12. [De70]
    DeGroot, Optimal Statistical Decisions, McGraw Hill Inc., N.Y., 1970.Google Scholar
  13. [DS77]
    Dalal & Srinivasan, Mangement S. 23(1977), 1284–1294.Google Scholar
  14. [EO83]
    Edelsbrenner & Overmars, "Batch Solutions ..." 1983, U. Utrecht RUU-CS-83-8.Google Scholar
  15. [Fe68]
    Feller, Introduction to Probability Theory and Its Applications, v.1, 1968.Google Scholar
  16. [FR75]
    Floyd & Rivest, CACM 18(1975), 165–172.Google Scholar
  17. [Fr81]
    Fredman, JACM 28(1981), 696–706.Google Scholar
  18. [GH81]
    Guptat Huang, Lecture Notes in Statistics, 1981.Google Scholar
  19. [GOS77]
    Gibbons, Olkin & Sobel, Selecting & Ordering Popul., 1977.Google Scholar
  20. [GRG80]
    Gonnet et al., Acta Inf., 13(1), 1980, 39–52.Google Scholar
  21. [Go75]
    Gottlieb, 1975 ACM SIGMOD Conference.Google Scholar
  22. [Ha77]
    Hannai, CACM, 20(1977), 344–347.Google Scholar
  23. [KTY83]
    Kerschberg et al., ACM's TODS 7(1982), 678–712.Google Scholar
  24. [LW80]
    Lee & Wong, ACM's TODS, 5(1980), 339–347.Google Scholar
  25. [OL82]
    Overmars & von Leeuvwen, Acta Inf. 17(1982), 267–286.Google Scholar
  26. [PK82]
    Paige & Koenig, ACM's TOPL, 1982, 402–454.Google Scholar
  27. [PR77]
    Pearl & Reingold, IPL, 6(1977), 219–222.Google Scholar
  28. [PIA78]
    Pearl, Itai & Avni, CACM 21(7), 1978, 550–554.Google Scholar
  29. [Ul82]
    Ullman, Principles of Database Systems, Computer Science Press, 1982.Google Scholar
  30. [Wie82]
    Wiederhold, Database Design, McGraw Hill, New York, 1982.Google Scholar
  31. [Wi78a]
    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. [Wi78b]
    —, "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. [Wi81]
    —, "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. [Wi83a]
    —, 21-st Allerton Conf. on Comm. Contr. and Comp., 1983, 663–675.Google Scholar
  35. [Wi83b]
    —, "Predicate Retrieval Theory," SUNY Albany, TR 83-3, Aug., 1983.Google Scholar
  36. [Wi83c]
    —, 21-st Allerton Conf. on Comm. Contr. and Comp., 1983, 656–662.Google Scholar
  37. [Wi83d]
    —, Inf. Proc. Lett., 24(1983), 81–84.Google Scholar
  38. [Wi84a]
    —, paper on relational calculus, at ACM's 1984 SIGMOD Conference.Google Scholar
  39. [Wi84b]
    —, JCSS, June 1984.Google Scholar
  40. [Wi84c]
    —, ACM 1984 Symp. on Theory of Comp.Google Scholar
  41. [WL83]
    Willard & Lueker, "Adding Range Restriction Capability to Dynamic Data Structures," to appear in Journal of ACM.Google Scholar
  42. [YY76]
    Yao & Yao, 17th IEEE FOCS, 1976, 173–177.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Dan E. Willard
    • 1
  1. 1.SUNY Albany CampusAlbany

Personalised recommendations