skip to main content
article
Free Access

Towards a theory of cost management for digital libraries and electronic commerce

Published:01 December 1998Publication History
Skip Abstract Section

Abstract

One of the features that distinguishes digital libraries from traditional databases is new cost models for client access to intellectual property. Clients will pay for accessing data items in digital libraries, and we believe that optimizing these costs will be as important as optimizing performance in traditional databases. In this article we discuss cost models and protocols for accessing digital libraries, with the objective of determining the minimum cost protocol for each model. We expect that in the future information appliances will come equipped with a cost optimizer, in the same way that computers today come with a built-in operating system. This article makes the initial steps towards a thery and practice of intellectual property cost management.

References

  1. ADAM, N., YESHA, Y., AWERBUCH, B., BENNETT, K., BLAUSTERN, B., BRODSHY, A., CHEN, R., DOGRAMCI, O., GROSSMAN, B., HOLOWCZAK, R., JOHNSON, J., KALPAKIS, K., MCCOLLUM, C., NECHES, A., NECHES, B., ROSENTHAL, A., SLONIM, J., WACTLAR, H., AND WOLFSON, O. 1996. Strategic directions in electronic commerce and digital libraries: Towards a digital agora. ACM Comput. Surv. 28, 4 (Dec.), 818-835.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. CAREY, M., AND LU, H. 1986. Load balancing in locally distributed database system. In Proceedings of the ACM-SIGMOD 1986 International Conference on Management of Data (Washington, D.C., May). ACM, New York, 108-119.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. CHANKHUNTHOD, A., DANZIG, P. B., NEERDAELS, C., SCHWARTZ, M. F., AND WORRELL, K.J. 1996. A hierarchical internet object cache. In Proceedings of USENIX (San Diego, CA, Jan.), 153-163.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. CHRISTODULAKIS, S. 1983. Estimating block transfers and join sizes. In Proceedings of the ACM-SIGMOD 1983 International Conference on Management of Data (San Jose, CA, May), ACM, New York, 40-54.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. CHRISTODULAKIS, S. 1984. Implications of certain assumptions in database performance evaluation. ACM Trans. Database Syst. 9, 2 (June), 163-186.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. CROWELLA, M. E., AND CARTER, R. L. 1995. Dynamic server selection in the internet. In Proceedings of the Third Workshop in the Architecture and Implementation of High Performance Communication Subsystems (Mystic CT, Aug.), 158-162.]]Google ScholarGoogle Scholar
  7. FRANKLIN, M.J. 1996. Client Data Caching. Kluwer Academic, Norwell, MA.]]Google ScholarGoogle Scholar
  8. FRANKLIN, M. J., JONSSON, B., AND KOSSMAN, D. 1996. Performance tradeoffs for clientservers query processing. In Proceedings of the ACM-SIGMOD 1996 International Conference on Management of Data (Montreal, Quebec, Canada, May), 149-160.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. GRAY, C., AND CHERITON, D. 1989. Leases: An efficient fault-tolerant mechanism for distributed file cache consistency. In Proceedings of the Twelfth International Symposium on Operating System Principles (Litchfield Park, AZ, Dec.), 202-210.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. GUYTON, J. D., AND SCHWARTZ, M. F. 1995. Locating nearby copies of replicated internet servers. Tech. Rep. TR CU-CS-762-95, Department of Computer Science, Univ. of Colorado, Boulder, Colo., February.]]Google ScholarGoogle Scholar
  11. GWERTZMAN, J., AND SELTZER, M. 1995. The case for geographical push caching. In Workshop on Hot Operating Systems (Orcas Island, WA, May), 51-55.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. GWERTZMAN, J., AND SELTZER, M. 1996. World-wide web cache consistency. In Proceedings of the 1996 Usenix Conference (San Diego, CA, Jan.), 141-151.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. HUANG, Y., SISTLA, P., AND WOLFSON, O. 1994a. Data replication for mobile computers. In Proceedings of the ACM-SIGMOD 1994 International Conference on Management of Data (Minneapolis, MN, May), 13-24.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. HUANG, Y., SLOAN, R., AND WOLFSON, O. 1994b. Divergence caching in client-server architectures. In Proceedings of the Third International Conference on Parallel and Distributed Information Systems (PDIS) (Austin, TX, Sept.), 131-139.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. IRANI, S., AND KARLIN, A.R. 1997. On online computation. In Approximation Algorithms for NP-Hard Problems, D. Hochbaum, ed. PWS Publishing, Boston, Mass., 521-564.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. KARLIN, A., MANASSE, M., RUDOLPH, L., AND SLEATOR, D. 1988. Competitive snoopy caching. Algorithmica 3, 1, 77-119.]]Google ScholarGoogle Scholar
  17. KISTLER, J., AND SATYANARAYANAN, M. 1991. Disconnected operation in the Coda file system. In Proceedings of the Thirteenth International Symposium on Operating System Principles (Pacific Grove, CA, Oct.), 213-225.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. LEVY, E., AND SILBERSHATZ, A. 1990. Distributed file systems: Concepts and examples. ACM Comput. Surv. 2, 4 (Dec.), 321-374.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. LIU, C., AND CAO, P. 1997. Maintaining strong cache consistency in the world-wide web. In Proceedings of the International Conference on Distributed Computing Systems, 97 (Baltimore, MD, May), 12-21.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. LI, K., AND HUDAK, P. 1989. Memory coherence in shared virtual memory systems. ACM Trans. Comput. Syst., 321-359.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. MOTWANI, R., AND RAGHAVAN, P. 1995. Randomized Algorithms. Cambridge University Press, New York.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. NITZBERG, B., AND LO, V. 1991. Distributed shared memory: A survey of issues and algorithms. IEEE Comput. 24, 8 (Aug.), 52-60.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. OBRACZKA, K., DANZIG, P., DELUCIA, D., AND TSAI, E-Y. 1996. A tool for massively replication internet archives: Design, implementation, and experience. In Proceedings of the International Conference on Distributed Computing Systems (Philadelphia, PA, May), 557-664.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. POPEK, G., GuY, R., PAGE, T., AND HERDEMANN, J. 1990. Replication in Ficus distributed file systems. In Proceedings of the Workshop in Management of Replicated Data. IEEE Computer Society Press, Los Alamitos, Calif. (Houston, TX, Nov.), 20-25.]]Google ScholarGoogle ScholarCross RefCross Ref
  25. ROSENSCHEIN, J., AND ZLOTKIN, a. 1994. Rules of Encounter: Designing Conventions for Automated Negotiation among Computers. MIT Press, Cambridge, MA.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. SIDEL, J., AOKI, P., SAH, A., STAELIN, C., STONEBRAKER, M., AND YU, A. 1996. Data replication in Mariposa. In Proceedings of the Twelfth International Conference on Data Engineering (New Orleans, La., Feb.), 485-494.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. SISTLA, P., WOLFSON, O., DAO, S., NARAYANAN, L., AND DRAJ, R. 1996. Architecture for consumer-oriented online database services. In Proceedings of the Sixth International Workshop on Research Issues in Data Engineering: Interoperability of Nontraditional Database Systems (RIDE-NDS'96) (New Orleans, LA, Feb.), 50-60.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. SRIVASTAVA, J., AND ELSESSER, G. 1993. Optimizing multi-join queries in parallel relational databases. In Proceedings of the Parallel and Distributed Information Systems Conference (San Diego, CA, Jan.), 84-92.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. ZAHARIOISDAKIS, M. AND CAREY, M.J. 1997. Hierarchical, adaptive cache consistency in a page server OODBMS. In Proceedings of the International Conference on Distributed Computing Systems, 97 (Baltimore, MD, May), 22-31.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Towards a theory of cost management for digital libraries and electronic commerce

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in

              Full Access

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader