An economic paradigm for query processing and data migration in Mariposa

Stonebraker, Michael; Devine, Robert; Kornacker, Marcel; Litwin, Witold; Pfeffer, Avi; Sah, Adam; Staelin, Carl

doi:10.1109/pdis.1994.331732

Cited by 119 publications

(77 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Market-oriented algorithms have been applied successfully towards solving complex resource allocation problems such as distributed multi-commodity flow in the trucking industry (Wellman 1993(Wellman , 1996, query processing and data migration in a distributed database (Stonebraker et al 1994), task scheduling in a distributed operating system (Huberman 1995, Malone et al 1988, Miller and Drexler 1988, network and file system resource allocation (Ferguson et al 1988, Gagliano and Mitchem 1996, Kurose and Simha 1989, Kuwabara et al 1996, Miller et al 1996, and Yemini 1981, allocating tradeable pollution permits (Marron and Bartels 1996), task allocation in discrete manufacturing systems (Baker 1996, Tilley 1996, and load balancing in distributed systems (Ferguson et al 1996). Most of the current research has focused on developing one of two types of economic models.…”

Section: Market Applicationsmentioning

confidence: 99%

“…Most of the current research has focused on developing one of two types of economic models. One is an exchange based economy (Sandholm 1993), the other is a price based economy (Miller and Drexler 1988, Stonebraker et al 1994, Waldspurger et al 1992, and Wellman 1993. Neither model fits the 0-1 multiple knapsack problem, where an approach using auctions is needed (Miller et al 1996 andSteiglitz et al 1996).…”

Section: Market Applicationsmentioning

confidence: 99%

See 1 more Smart Citation

Approximating the 0–1 Multiple Knapsack Problem with Agent Decomposition and Market Negotiation

Smolinski

2000

Intelligent Problem Solving. Methodologies and Approaches

View full text Add to dashboard Cite

The 0-1 multiple knapsack problem appears in many domains from financial portfolio management to cargo ship stowing. Methods for solving it range from approximate algorithms, such as greedy algorithms, to exact algorithms, such as branch and bound. Approximate algorithms have no bounds on how poorly they perform and exact algorithms can suffer from exponential time and space complexities with large data sets. This paper introduces a market model based on agent decomposition and market auctions for approximating the 0-1 multiple knapsack problem, and an algorithm that implements the model (M(x)). M(x) traverses the solution space rather than getting caught in a local maximum, overcoming an inherent problem of many greedy algorithms. The use of agents ensures that infeasible solutions are not considered while traversing the solution space and that traversal of the solution space is not just random, but is also directed. M(x) is compared to a bound and bound algorithm (BB) and a simple greedy algorithm with a random shuffle (G(x)). The results suggest that M(x) is a good algorithm for approximating the 0-1 Multiple Knapsack problem. M(x) almost always found solutions that were close to optimal in a fraction of the time it took BB to run and with much less memory on large test data sets. M(x) usually performed better than G(x) on hard problems with correlated data.

show abstract

Section: Market Applicationsmentioning

confidence: 99%

Section: Market Applicationsmentioning

confidence: 99%

Approximating the 0–1 Multiple Knapsack Problem with Agent Decomposition and Market Negotiation

Smolinski

2000

Intelligent Problem Solving. Methodologies and Approaches

View full text Add to dashboard Cite

show abstract

“…In this paper, we h a v e shown how the economic mechanisms described in [STON94b] can be extended to support replicated fragments. Replica management falls neatly into the economic model.…”

Section: Discussionmentioning

confidence: 99%

“…There has been considerable research devoted to studying replica management, resulting in a wide variety of proposed solutions. In Mariposa we h a v e adopted an economic framework for managing data objects and query processing [STON94b]. This paper describes how we propose to integrate replica management and replica control into this framework.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Data replication in Mariposa

Sidell¹,

Aoki²,

Sah³

et al.

Proceedings of the Twelfth International Conference on Data Engineering

Self Cite

View full text Add to dashboard Cite

The Mariposa distributed data manager uses an economic model for managing the allocation of both storage objects and queries to servers. In this paper, we present extensions to the economic model which support replica management, as well as our mechanisms for propagating updates among replicas. We show h o w our replica control mechanism can be used to provide consistent, although potentially stale, views of data across many machines without expensive per-transaction synchronization. We present a rule-based conict resolution mechanism, which can be used to enhance traditional time-stamp serialization. We discuss the eects of our replica system on query processing for both read-only and read-write queries. We further demonstrate how the replication model and mechanisms naturally support name service in Mariposa.

show abstract

SuperWeb: research issues in Java-based global computing

Alexandrov

Ibel

Schauser

et al. 1997

Concurrency: Pract. Exper.

View full text Add to dashboard Cite

The Internet, in particular the World Wide Web, continues to expand at an amazing pace. We propose a new infrastructure, SuperWeb, to harness global resources, such as CPU cycles or disk storage, and make them available to every user on the Internet. SuperWeb has the potential for solving parallel supercomputing applications involving thousands of co‐operating components on the Internet. However, we anticipate that initial implementations will be used inside large organizations with large heterogeneous intranets. Our approach is based on recent advances in Internet connectivity and the implementation of safe distributed computing realized by languages such as Java. Our SuperWeb prototype consists of brokers, clients and hosts. Hosts register a fraction of their computing resources (CPU time, memory, bandwidth, disk space) with resource brokers. Clients submit tasks that need to be executed. The broker maps client computations onto the registered hosts. We examine an economic model for trading computing resources, and discuss several technical challenges associated with such a global computing environment. © 1997 John Wiley & Sons, Ltd.

show abstract

An economic paradigm for query processing and data migration in Mariposa

Cited by 119 publications

References 16 publications

Approximating the 0–1 Multiple Knapsack Problem with Agent Decomposition and Market Negotiation

Approximating the 0–1 Multiple Knapsack Problem with Agent Decomposition and Market Negotiation

Data replication in Mariposa

SuperWeb: research issues in Java-based global computing

Contact Info

Product

Resources

About