skip to main content
10.5555/782052.782067dlproceedingsArticle/Chapter ViewAbstractPublication PagescasconConference Proceedingsconference-collections
Article
Free Access

Performance aspects of dynamic re-allocation for partitioned data

Authors Info & Claims
Published:12 November 1996Publication History

ABSTRACT

The correct and effcient management of data in distributed databases or mobile computing environments is diffcult. Communication disruptions within such systems render the execution of database transactions problematic due to difficulties in atomic commitment strategies. A previously proposed non-traditional system for data and operators, with single site transaction executions and decentralized commitment [9], is useful in specific applications. For this approach, we use some simple analytical and simulation models to assess performance, and provide our findings for straightforward demand-driven and periodic re-allocation strategies.

References

  1. {1} P. A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading, MA, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. {2} S. Davidson et al. Consistency in partitioned networks. ACM Computing Surveys , 17(3):341-370, September 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. {3} L. Dowdey and C. Lowery. P.S. to Operating Systems. Prentice Hall, New Jersey, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. {4} M. R. Garey and D. S. Johnson. Computers and Intractability.W. H. Freeman and Company, New York, 1979. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. {5} T. Imielinski and B. R. Badrinth. Mobile wireless computing: Challenges in data management. Communications of the ACM, October 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. {6} V. Mendiratta. A dynamic optimization model of the empty rail car distribution process. 1994.Google ScholarGoogle Scholar
  7. {7} A. Silberschatz, J. Peterson, and P. Galvin. Operating System Concepts. Addison-Wesley Publishing Co., 1991. Third edition. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. {8} D. Skeen. Crash recovery in a distributed database system. Ph.D. dissertation. Department of Electrical Engin. & Computer Sci., University of California, Berkeley, May 1982.Google ScholarGoogle Scholar
  9. {9} N. R. Soparkar and A. Silberschatz. Data-value partitioning and virtual messages. In Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Nashville, pages 357-367, April 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. {10} M. P. Wellman. A market-oriented programming environment and its application to distributed multicommodity flow problems. Journal of Artificial Intelligence Research 1, 1-23, 1993.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Performance aspects of dynamic re-allocation for partitioned data

              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
              • Article Metrics

                • Downloads (Last 12 months)1
                • Downloads (Last 6 weeks)0

                Other Metrics

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader