1996
DOI: 10.1007/s007780050015
|View full text |Cite
|
Sign up to set email alerts
|

Mariposa: a wide-area distributed database system

Abstract: Abstract. The requirements of wide-area distributed database systems differ dramatically from those of local-area network systems. In a wide-area network (WAN) configuration, individual sites usually report to different system administrators, have different access and charging algorithms, install site-specific data type extensions, and have different constraints on servicing remote requests. Typical of the last point are production transaction environments, which are fully engaged during normal business hours,… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
143
0
3

Year Published

2001
2001
2010
2010

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 253 publications
(149 citation statements)
references
References 21 publications
0
143
0
3
Order By: Relevance
“…For execution over multiple nodes in robust networks, the second phase is comparatively simple: one step partitions the PAF into fragments and another step allocates them to suitably resourced sites, as in, e.g., [22]. One approach to achieving this is to map the physical-algebraic form of a query to a distributed one in which EXCHANGE operators [23] define boundaries between fragments.…”
Section: Phase 2: Multi-site Optimizationmentioning
confidence: 99%
See 1 more Smart Citation
“…For execution over multiple nodes in robust networks, the second phase is comparatively simple: one step partitions the PAF into fragments and another step allocates them to suitably resourced sites, as in, e.g., [22]. One approach to achieving this is to map the physical-algebraic form of a query to a distributed one in which EXCHANGE operators [23] define boundaries between fragments.…”
Section: Phase 2: Multi-site Optimizationmentioning
confidence: 99%
“…In classical DQP, the optimizer does not have to consider the network topology, as this is abstracted away by the network protocols. As such, the corresponding focus of where-scheduling in DQP tends to be on finding sites with adequate resources (e.g., memory and bandwidth) available to provide the best response time (e.g., Mariposa [22]). …”
Section: Where-schedulingmentioning
confidence: 99%
“…Application of an economic model to adaptive query processing and dynamic load-balancing in a non real-time context was proposed in [50]. Load-balancing heuristics for use in a distributed real-time system are described in [49].…”
Section: Related Workmentioning
confidence: 99%
“…A node can accept queries over an XML view and internally translate the query into SQL [44,45]. An early attempt towards a WAN distributed DBMS was Mariposa [46], designed for scalability to many cooperating sites, data mobility, no global synchronization and local autonomy. It used an economic model and bidding for adaptive query processing, data placement and replication.…”
Section: Related Workmentioning
confidence: 99%