Query Processing in Distributed Database System

DOI10.1109/TSE.1979.234179MaRDI QIDQ4179821zbMATH OpenOpenAlexFDO

Authors Alan R. Hevner, S. Bing Yao

Publication date 1979

Published in IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tse.1979.234179

zbMATH Keywords

Distributed Database SystemsQuery Processing

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Algorithms in computer science (68W99) Theory of operating systems (68N25)

Cited in

(10)

• A constrained nonlinear 0-1 program for data allocation
• Optimising the distributed execution of join queries in polynomial time
• An integer programming formulation embedded in an algorithm for query processing optimization in distributed relational database systems
• Database placement in communication networks for minimizing the overall transmission cost
• Properties of semijoin sequences
• Strategies for distributed query optimization
• Optimization of distributed tree queries
• A statistical model for estimating the number of records in a relational database
• Querying fragmented relations in a distributed database
• Asserting the optimality of serial SJRPs in processing simple queries in chain networks

This page was built for publication: Query Processing in Distributed Database System

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4179821)