Orchestra: rapid collaborative sharing of dynamic data

Date

2005-01-04

Author

Ives, Zachary
Khandelwal, Nitin
Kapur, Aneesh
Çakır, Murat Perit

Metadata

Show full item record

Item Usage Stats

38
views

0
downloads

Conventional data integration techniques employ a “top-down” design philosophy, starting by assessing requirements and defining a global schema, and then mapping data sources to that schema. This works well if the problem domain is well-understood and relatively static, as with enterprise data. However, it is fundamentally mismatched with the “bottom-up” model of scientific data sharing, in which new data needs to be rapidly developed, published, and then assessed, filtered, and revised by others. We address the need for bottom-up collaborative data sharing, in which independent researchers or groups with different goals, schemas, and data can share information in the absence of global agreement. Each group independently curates, revises, and extends its data; eventually the groups compare and reconcile their changes, but they are not required to agree. This paper describes our initial design and prototype of the ORCHESTRA system, which focuses on managing disagreement among multiple data representations and instances. Our work represents an important evolution of the concepts of peer-to-peer data sharing [23], which considers revision, disagreement, authority, and intermittent participation.

URI

http://www-db.cs.wisc.edu/cidr/cidr2005/index.html
https://hdl.handle.net/11511/84106

Conference Name

Conference on Innovative Database Systems Research, CIDR (2005)

Collections

Graduate School of Informatics, Conference / Seminar

Suggestions

OpenMETU
Core

HyGraph: a subgraph isomorphism algorithm for efficiently querying big graph databases Asiler, Merve; Yazıcı, Adnan; George, Roy (2022-04-01) The big graph database provides strong modeling capabilities and efficient querying for complex applications. Subgraph isomorphism which finds exact matches of a query graph in the database efficiently, is a challenging problem. Current subgraph isomorphism approaches mostly are based on the pruning strategy proposed by Ullmann. These techniques have two significant drawbacks- first, they are unable to efficiently handle complex queries, and second, their implementations need the large indexes that require ...
Data integration over horizontally partitioned databases in service-oriented data grids Sunercan, Hatice Kevser Sönmez; Çiçekli, Fehime Nihan; Alpdemir, Mahmut Nedim; Department of Computer Engineering (2010) Information integration over distributed and heterogeneous resources has been challenging in many terms: coping with various kinds of heterogeneity including data model, platform, access interfaces; coping with various forms of data distribution and maintenance policies, scalability, performance, security and trust, reliability and resilience, legal issues etc. It is obvious that each of these dimensions deserves a separate thread of research efforts. One particular challenge among the ones listed above tha...
Ensemble Detection: A New Architecture for MultiSensor Data Fusion with Ensemble Learning for Object Detection Ozay, Mete; Akalin, Okan; Yarman-Vural, Fatos T. (2009-09-16) In this work, we propose a framework for multimodal data fusion at decision level under a multilayer hierarchical ensemble learning architecture. The architecture provides a generative discriminative model for probability density estimations and decreases the entropy of the data throughout the vector spaces. The architecture is implemented for human motion detection problem, where the motion analysis problem is formulated as a multi-class classification problem on audio-visual data. The vector space transfo...
Performance-based parametric design explorations: A method for generating appropriate building components Ercan, Burak; Elias Özkan, Soofia Tahira (2015-05-01) Performance-based parametric design explorations depend on formulating custom-designed workflows that require reading, writing, interpreting and manipulating databases, as part of the design process. The possibilities of customization and parameterization offered by the user-friendly interfaces of advanced building-performance simulation software and digital design tools have now enabled architects to carry out performance-based design explorations without the help of simulation experts. This paper presents...
Exploiting Index Pruning Methods for Clustering XML Collections Altıngövde, İsmail Sengör; Ulusoy, Ozgur (2010-01-01) In this paper, we first employ the well known Cover-Coefficient Based Clustering Methodology (C3 M) for clustering XML documents. Next, we apply index pruning techniques from the literature to reduce the size of the document vectors. Our experiments show that for certain cases, it is possible to prune up to 70% of the collection (or, more specifically, underlying document vectors) and still generate a clustering structure that yields the same quality with that of the original collection, in terms of a set o...

Citation Formats

Z. Ives, N. Khandelwal, A. Kapur, and M. P. Çakır, “Orchestra: rapid collaborative sharing of dynamic data,” Asilomar, CA, 2005, p. 107, Accessed: 00, 2021. [Online]. Available: http://www-db.cs.wisc.edu/cidr/cidr2005/index.html.