Skip to main content
SpringerLink
Log in

A Heuristic for Rule Allocation in Distributed Deductive Database Systems

  • Conference paper
Rules in Database Systems

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

Allocation of rules to sites in a distributed deductive database system is an important and challenging task especially for a large knowledge base. We identify communication cost in rule execution to be the primary basis for decomposing a global knowledge base into clusters for their allocation to sites. It has been shown that the problem of optimal allocation is a 0–1 quadratic programming problem, which has prohibitive execution times for large knowledge bases. We propose an efficient heuristic algorithm for rule allocation and study its performance experimentally. We represent a knowledge base as a hierarchy of rules. These rules are then allocated in a bottom-up fashion w.r.t. the hierarchy. The experimental results of the heuristic algorithm on random hierarchies as well as on hierarchies with varying heights are seen to be close to the optimal solution.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Banarjee, W. Kim, S.J. Kim, and J.F. Garra. Clustering a DAG for CAD databases. IEEE Transactions on Software Engineering, 14(11):1684–1699, Nov. 1988.

    Article  Google Scholar 

  2. D.A. Carlson and S. Ram. An architecture for distributed knowledge base systems. DATA BASE,22(1):11–21, 1991.

    Google Scholar 

  3. S. Ceri, G. Gottlob, and L. Tanca. Logic Programming and Databases. Springer-Verlag Berlin Heidelberg New York, 1990.

    Book  Google Scholar 

  4. S. Ceri and G. Pelagatti. Distributed Databases: Principles and Systems. McGraw-Hill Book Co., 1986.

    Google Scholar 

  5. J.R. Chang and A.R. Hurson. Effective clustering of complex objects in OODB.In Proc. ACM SIGMOD Int. Conf. on Management of Data, pages 22–31, May 1991.

    Google Scholar 

  6. V.V. Dixit and D.I. Moldovan. The allocation problem in parallel production systems. Journal of Parallel and Distributed Computing, 8:20–29, 1990.

    Article  Google Scholar 

  7. M. Gallaire, J. Minker, and J. Nicolas. Logic and database: A deductive approach. ACM Computing Survey, 16(2):153–185, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  8. M.R. Garey and D.S Johnson. Computers and Intractability: A Guide to the theory of NP-Completeness. W.H.Freeman and Company New York, 1979.

    MATH  Google Scholar 

  9. M.A. Jabri. A prolog knowledge based systems shell for vlsi cad. In 27th Design Automation Conference, IEEE CS Press, pages 272–277, June 1990.

    Google Scholar 

  10. Anil K. Jain and R.C. Dubes. Algorithms for Clustering Data. Prentice Hall Advanced Series, 1988.

    Google Scholar 

  11. W. Kim, H.T. Chou, and J. Banerjee. Operations and implementation of complex objects. In Proc. 3rd Int. Conf. on Data Engg., pages 626–633, 1987.

    Google Scholar 

  12. Y.P. Li. DKM: A distributed knowledge representation framework. In Proc. 2nd Int. Conf. on Expert Database, pages 313–331, 1988.

    Google Scholar 

  13. P. Markenscoff and W. Liaw. Task allocation problems in distributed computer systems. In Proc. Int. Conf. on Parallel Processing, pages 953–960, 1986.

    Google Scholar 

  14. M.K. Mohania. Decomposition of a knowledge base for a distributed deductive database system. In 4 th Int-Conf. on Management of Data, Bangalore India, pages 94–106, Dec. 1992.

    Google Scholar 

  15. M.K. Mohania and N.L. Sarda. An architecture for a distributed deductive database system. Appearing in IEEE TENCON′93, Bezing, China, 1993.

    Google Scholar 

  16. K. Oflazer. Partitioning in parallel processing of production systems. In Proc. Int. Conf. on Parallel Processing, pages 92–100, 1984.

    Google Scholar 

  17. H.S. Stone. Multiprocessor scheduling with the aid of network flow algorithms. IEEE Transactions on Software Engineering, 3(l):85–93, Jan. 1977.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Engg., Indian Institute of Technology, Bombay, India

    Mukesh K. Mohania & N. L. Sarda

Authors
  1. Mukesh K. Mohania
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. L. Sarda
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing and Electrical Engineering, Heriot-Watt University, Riccarton, Edinburgh, EH 14 4AS, Scotland

    Norman W. Paton BSc, PhD  & M. Howard Williams BSc, PhD, FRSA, FBCS, CEng  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1994 British Computer Society

About this paper

Cite this paper

Mohania, M.K., Sarda, N.L. (1994). A Heuristic for Rule Allocation in Distributed Deductive Database Systems. In: Paton, N.W., Williams, M.H. (eds) Rules in Database Systems. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3225-7_23

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3225-7_23

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19846-8

  • Online ISBN: 978-1-4471-3225-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation