J. Wolfe
- ARC News, "JOPES, A Planned Reuse Success," The Army Reuse Center News, 2:4, Fort Belvior, VA., December, 1993.Google Scholar
- Bemstein, P.A., "Synthesizing third normal form relations from functional dependencies," A CM Trans. on Database Systems 1:4 (1976), pp. 277-298. Google ScholarDigital Library
- Carlson, C.R. and R.S. Kaplan., "A generalized access path model and its application to a relational database system," A CM SIGMOD Intl. Conf. on Management of Data, (1976), pp. 143-156. Google Scholar
- Chang, T.H., "A Universal Relation Data Model with Semantic Constructs" PhD Dissertation, Boston Univ., 1988. Google ScholarDigital Library
- Codd, E.F., "A relational model for large shared data banks," Communication of the ACM 13:6, (June, 1970) pp. 377-387. Google ScholarDigital Library
- Codd, E.F., "How About Recently? (English dialog with relation data bases using RENDEZVOUS Version 1)" in Databases: Improving Usability and Responsiveness, Ben Schneiderman, ed., Academic Press, New York, 1978, pp. 3-27.Google Scholar
- Date, C.J., An Introduction to Database Systems, Volume H, Addison-Wesley Publishing Company, Inc., Reading, MA, 1983. Google ScholarDigital Library
- Date, C.J., Relational Database; Selected Writings, Addison-Wesley Publishing Company, Inc., Reading, MA., 1986. Google ScholarDigital Library
- Date, C.J., A Guide to the SQL Standard, Addison-Wesley Publishing Company, inc., Reading, MA, 1989. Google ScholarDigital Library
- Honeyman, P., R.E. Ladner, and M. Yannakakis, "Testing the universal instance assumption," Information Processing Letters, 10:1, (1980) pp. 14-19.Google ScholarCross Ref
- Maier, D., D. Rozenshtein, and D.S. Warren, "Window Functions," in Advances in Computing Research 3, P. Kanellakis, ed., JAI Press, London, 1986.Google Scholar
- Maier, D., J.D. Ullman, and M.Y. Vardi, "On the foundations of the universal relation model," ACM Trans. on Database Systems 9:2, (1984) pp. 283- 308. Google ScholarDigital Library
- Osbom, S.L., "Towards a universal relation interface," Proc. Intl. Conf. on Very Large Data Bases, (1979), pp. 52-60.Google Scholar
- Schenk, K.L. and J.R. Pinkert, "An algorithm for servicing multirelational queries," A CM SIGMOD Intl. Conf. on Management of Data, (1977), pp. 10-19. Google ScholarDigital Library
- Ullman, J.D., "The U.R. strikes back," Proc. First A CM Symp. on Principles of Database System, (1982), pp. 10-22. Google ScholarDigital Library
- Ullman, J.D., Principles of Database and Knowledge - Base Systems; Volume II: The New Technologies, Computer Science Press, Rockville, MD. 1989. Google ScholarDigital Library
Index Terms
- Ad Hoc Query: a reusable database access capability
Recommendations
Efficient on-demand routing for mobile ad hoc wireless access networks
In this paper, we consider a mobile ad hoc wireless access network in which mobile nodes can access the Internet via one or more stationary gateway nodes. Mobile nodes outside the transmission range of the gateway can continue to communicate with the ...
Opportunistic media access control and routing for delay-tolerant mobile ad hoc networks
In delay-tolerant mobile ad hoc networks, motion of network nodes, network sparsity and sporadic density can cause a lack of guaranteed connectivity. These networks experience significant link delay and their routing protocols must take a store-and-...
Query localization techniques for on-demand routing protocols in ad hoc networks
Selected Papers from Mobicom'99Mobile ad hoc networks are characterized by multi-hop wireless links, absence of any cellular infrastructure, and frequent host mobility. Design of efficient routing protocols in such networks is a challenging issue. A class of routing protocols called ...
Comments