A research agenda for query processing in large-scale peer data management systems

2008 ◽  
Vol 33 (7-8) ◽  
pp. 597-610 ◽  
Author(s):  
Katja Hose ◽  
Armin Roth ◽  
André Zeitz ◽  
Kai-Uwe Sattler ◽  
Felix Naumann
2003 ◽  
Vol 33 (3) ◽  
pp. 422-429 ◽  
Author(s):  
John Nelson

Significant advances have been made that integrate landscape issues in forest-level models. These advanced models are designed to simulate and evaluate economic, ecological, and social goals that are included in the management of forests. The application of multiple-objective heuristics such as tabu search and simulated annealing, combined with remarkable advances in computing power, now allows us to explore highly complex management scenarios over long time horizons and over vast geographic scales. While the power of these decision support systems is highly appealing, and even intoxicating, we still face three sobering challenges on the path towards generating credible forecasts. First, advanced data acquisition and data management systems are needed to support these systems. Data management systems must have high storage capacity, be capable of rapid updates, and accommodate a seemingly endless demand for queries from customers, government agencies, and the public. Planning is an interdisciplinary, hierarchical process, and team members have different data demands, depending on where they fit in the hierarchy. Second, the models must be verified. Multiple-objective models have dozens of parameters, and when these are combined with random search techniques, they become difficult to understand and replicate. Thorough sensitivity analysis is needed to test model parameters, goal weights, and assumptions of uncertainty. Finally, our ability to formulate and run large-scale, long-term forecasting models often exceeds the scientific credibility of the data, especially for complex forest ecosystems. In the absence of critical thinking, such powerful models can become dangerous weapons.


2011 ◽  
Vol 20 (03) ◽  
pp. 261-305
Author(s):  
JIE ZHAO ◽  
RACHEL POTTINGER ◽  
CODY BROWN ◽  
SHRIRAM RAJAGOPALAN

Peer Data Management Systems (PDMSs) allow the efficient sharing of data between peers with overlapping sources of information. These sources share data through mappings between peers. In current systems, queries are asked over each peer's local schema and then translated using the mappings between peers. While this allows the data to be accessed uniformly, users lack access to information that is not in their own schemas. In this paper, we propose a light-weight, automatic method to create a mediated schema in a PDMS. Our work benefits PDMSs by allowing access to more data and without unduly stressing the peer's resources or requiring additional resources such as ontologies. We present our system — MePSys, which creates a mediated schema in PDMSs automatically using the existing mappings provided to translate queries. We further discuss how to update the mediated schema in a stable state, i.e. after the system setup period.


Sign in / Sign up

Export Citation Format

Share Document