Efficient processing of relational calculus expressions using range query theory

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 1984, Pages 164-175

  Willard, Dan E ^a,b  

^a STATE UNIVERSITY OF NEW YORK   (United States)

^b TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 70349129233     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/602259.602281     Document Type: Conference Paper

References (70)

1. [Ab74)Abrial, in Data Base Management, North Holland Publishing Co., 1974, 1-60.
2. [ABU79] Aho, Berri & Ullman, ACM TODS, (4) 1979, 297-314.
3. [AHU74]Aho, Hopcroft & Ullman, The Design and Analysis of Computer Algorithms, 1974.
4. [BC81]Bernstein & Chiu, JACM, 28, 1981, 25-40.
5. [Be75]Bentley, CACM, 18 (1975 ), 509-517.
6. [Be80]Bentley, CACM, 23 (1980), 214-228.
7. [BFMMUY81] Berri, et al., 13th ACM STOC (1981), 355-362.
8. [BFMY83]Berri, et al., JACM, 30, 1983, 479-514.
9. [BG81a]Bernstein & Goodman, SIAM J. Comput., 10 (1981), 751-771.
10. [BG81b]Bernstein & Goodman, Inf. Syst., (6 ) 1981, 255-264.
11. [BM80]Bentley & Maurer, Acta Inf., 13 (1980), 155- 168.
12. [BS77]Bentley & Shamos, 15-th Allerton Conf. on Comm. Contr. and Comp., (1977), 193-201.
13. [BS80] Bentley & Saxe, J. Algorithms, 1 (1980), 301-358.
14. [Ch76]Chen, TODS, (1), 1976, 9-36.
15. [CH80]Chiu & Ho., 1980 SIGMOD Conf., 160-168.
16. [CH83]Chazelle, 24-th IEEE FOCS, (1983), 122-132.
17. [Co70]Codd, CACM, 13 (1970), 377-397.
18. [CY83]Cole & Yap, 24-th IEEE FOCS, (1983), 112-121.
19. [Da83]Dayal, 2-nd ACM PODS, 1903, 125-137.
20. [Ed81] Edelsbrenner, Bulletin of EATCS, (15) 1981, 34-40.
21. [E083] Edelsbrenner & Overmars, "Batch Solutions to Decomposable Search Problems, " Univ. Utrecht RUU-CS-83-8, 1983.
22. [EW83] Edelsbrenner & Welzl, "Halfplanar Range Search in Linear Space and 0(n695 ) Query Time, " Univ. of Graz Report F- 111, 1983.
23. [Fa83] Fagin, JACM, 30 (1983), 514-551.
24. [FKS82]Fredman, Komlos & Szemeredi, 23-rd IEEE FOCS, 1982, 165-170.
25. [Fr81] Fredman, JACM, 28 (1981), 696-706.
26. [GP84]Goldberg & Paige, "Strenn Processing, " Rutgers TM, 1984.
27. [GS82]Goodman & Shmueli, TODS, 4 (1982), 653-678.
28. [HK80]Hecht & Kerschberg, "Update Semantics for the functional data base model, " Bell Labs technical memorandum 1980. Write Kershberg at Univ. of South Carolina to get a copy.
29. [HS81a]Horowitz & Sahni, Fundamentals of Data Structures, 1978.
30. [HS8 lb]Horowitz & Sahni, Fundamentals of Computer Algorithms, 1978.
31. [Hu83] Hull, JCSS, 1983.
32. [JK83] Jarke & Koch, ACM SIGMOD Symp., (1983). 196- 206.
33. [Kn73]Knuth, The Art of Computer Programming, vol. 3, 1973.
34. [KP81] Koenig & Paige, 7-th VLDB, 1981, 306-318.
35. [KTY82] Kerchberg, et al., ACM TODS, (4) 1982, 653- 677.
36. [Li82]Lien, JACM, 29 (1982), 333-362.
37. [LST81] Lien, Shapiro & Tsur, 7-th VLDB, 1981, 306.
38. [LW77] Lee & Wong, Acta Inf., 9 (1977), 23-29.
39. [LW80)Lee & Wong, ACM TODS, 5 (1980), 339-347.
40. [MSY82]Maier, Sagiv & Yannakakis, J. ACM, 28 (1982 ), 680-695.
41. [MU82]Maier & Ullman, 1-st PODS, 1982, 34-39.
42. [OL82]Overmars & Leeuvwen, Acta Inf. 17(1932)267-286.
43. [Pa79] Paige, Ph.D. dissertation, NYU, 1979.
44. [Pa8] Papademitriyou, 1981 ACM SIGMOD Conference.
45. [Pa84]Paige, to appear in Advances in Database Theory.
46. [PK82]Paige & Koenig, ACM T0PLAS, 1982, 402-454.
47. [RND77] Reingold, Nievergelt & Deo, Combinational Algorithms: Theory and Practice, 1977.
48. [RSL78]Rosenkrantz, Stearns & Lewis, ACM TODS, (3) 1978, 178-198.
49. [Sh8] Shipman, ACM TODS, 6 (1981), 140-173.
50. [SK77] Sibley & Kerschberg, Proc NCC, AFIPS, 1977, 85-96.
51. [SLR76]Stearns, Lewis & Rosenkrantz, 17-th IEEE FOCS, 1976, 19-32.
52. [Ul82]Ullman, Principles of Database Systems, 1982.
53. [Wi78a]Willard, Ph.D. thesis, Harvard University, 1978. Published 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.
54. [Wi78b]Willard, "New Data Structure for Orthogonal Queries, " first draft was Harvard TR-22-78 (1978 ), second draft appeared in Proceedings 1982 Allerton Conference, third draft to appear in SIAM J. Comp.
55. [Wi78c]Willard, "Balanced Forests of K-d∗ Trees as a Dynamic Data Structure, " Technical Report TR-23-78 (1978), Center for Research in Computing Technology, Harvard University, 1978. Revised and reissued as "K-d Trees in a Dynamic Environment, " Technical Report No. 80-1, Department of Computer Science, The University of Iowa, 1980. To appear in CACM.
56. [Wi82]Willard, SIAM J. Comp., (11) 1982, 149-162.
57. [Wi83a]Willard, 21-st Allerton Conf. on Comm., Contr., and Comp., 1983, 663-675.
58. [Wi83b]Willard, SUNY Albany Technical Report 83-3, 1983.
59. [Wi83c]Willard, 21-st Allerton Conf., 1983, 656.
60. [Wi83d]Willard, Inf. Proc. L et., 24 (1983), 81-84.
61. [Wi84a]Willard, at 1984 Int. Col, on Automata, Languages and Programming.
62. [Wi84b]willard, at 1984 ACM STOC Conference.
63. [Wi84c]Willard, to appear in JCSS, June 1984.
64. [WL84]Willard & Leuker, to appear in J. of ACM.
65. [WY76]Wong & Youssefi, ACM TODS, (1973), 233-241.
66. [Ya8 ]Yannakakis, 6 -th VLDB, (1981), 82-94.
67. [Ya83]Yao, 15-th ACM STOC, (1983), 258-264.
68. [Y079]Yu & Ozsoyoglu, COMPSAC, 1979, 306-312.
69. [Za76]Zaniolo, Ph.D. dissertation, UCLA, 1976.
70. [Ya82]Yao, 14th ACM STOC (1982), 128-136.