Infrastructure for Information Spaces
ADBIS '02 Proceedings of the 6th East European Conference on Advances in Databases and Information Systems
PSoup: a system for streaming queries over streaming data
The VLDB Journal — The International Journal on Very Large Data Bases
Streaming queries over streaming data
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
International Journal of Web Engineering and Technology
A subscribable peer-to-peer RDF repository for distributed metadata management
Web Semantics: Science, Services and Agents on the World Wide Web
Continuous constraint query evaluation for spatiotemporal streams
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Collection and object synchronization based on context information
MATA'05 Proceedings of the Second international conference on Mobility Aware Technologies and Applications
Metadata based management and sharing of distributed biomedical data
International Journal of Metadata, Semantics and Ontologies
Hi-index | 0.00 |
The emergence of electronic marketplaces and other electronic services and applications on the Internet is creating a growing demand for effective management of resources. Due to the nature of the Internet such information changes rapidly. Furthermore, such information must be available for a large number of users and applications, and copies of pieces of information should be stored near the users that need this particular information. In this paper, we present the architecture of MDV, a distributed metadata management system. MDV has a 3-tier architecture and supports caching and replication in the middle-tier so that queries can be evaluated locally. Users and applications specify the information they need and that is replicated using a specialized subscription language. In order to keep replicas up-to-date and initiate the replication of new and relevant information, MDV implements a novel, scalable publish & subscribe algorithm. We describe this algorithm in detail, show how it can be implemented using a standard relational database system, and present the results of performance experiments conducted using our prototype implementation.