Query processing in self-profiling composable peer-to-peer mediator databases

DOI10.1007/3-540-36128-6_42MaRDI QIDQ4439749zbMATH OpenFDO

Authors Timour Katchaounov

Publication date 15 December 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2490/24900627.htm

Mathematics Subject Classification ID

Database theory (68P15) Computing methodologies and applications (68U99)

Recommendations

• Efficient querying of distributed resources in mediator systems
• Query decomposition for a distributed object-oriented mediator system

Cited in

(5)

• Flexible and scalable cost-based query planning in mediators: A transformational approach
• A generic proposal for a transparent integration of distributed data by an autonomous layer in a virtual repository12
• dbRouter -- A scaleable and distributed query optimization and processing framework
• Efficient code deployment for heterogeneous distributed data sources
• Efficient querying of distributed resources in mediator systems

This page was built for publication: Query processing in self-profiling composable peer-to-peer mediator databases

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