home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #31 / NN_1992_31.iso / spool / comp / database / 8769 < prev    next >
Encoding:
Internet Message Format  |  1993-01-03  |  915 b 
  1. Xref: sparky comp.databases:8769 comp.theory:2782
  2. Path: sparky!uunet!ogicse!mintaka.lcs.mit.edu!ai-lab!life.ai.mit.edu!tmb
  3. From: tmb@arolla.idiap.ch (Thomas M. Breuel)
  4. Newsgroups: comp.databases,comp.theory
  5. Subject: computational complexity and databases
  6. Message-ID: <TMB.93Jan3190318@arolla.idiap.ch>
  7. Date: 4 Jan 93 03:03:18 GMT
  8. Article-I.D.: arolla.TMB.93Jan3190318
  9. Reply-To: tmb@idiap.ch
  10. Followup-To: comp.databases
  11. Distribution: world
  12. Organization: IDIAP (Institut Dalle Molle d'Intelligence Artificielle
  13.     Perceptive)
  14. Lines: 12
  15. NNTP-Posting-Host: arolla.idiap.ch
  16.  
  17. I'm interested in the "standard references" describing known results
  18. in computational complexity of database retrieval, space/time
  19. tradeoffs, etc. Textbooks, recent surveys, and pointers to key
  20. articles would be appreciated.
  21.  
  22. If response warrants it, I'll post a summary/digest of everything I
  23. receive.
  24.  
  25.                 Thanks,
  26.                     Thomas.
  27.  
  28.                 tmb@idiap.ch
  29.