George Copeland et. al. Data Placement in Bubba. In Proceedings SIGMOD 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
A Performance Study of Three High Availability Data.. - Hsiao, Dewitt (1993) (11 citations) (Correct)
....copies are updated synchronously) and, unless both copies fail simultaneously, the failure will bc transparent to users of the system and no interruption of service will occur. Examples of 54 this mechanism include mirrored disks[2, 18] interleaved declustering [27] the inverted file strategy [6], and chained aleclustering [15 . In the second approach, the data, along with the redundant error detection correction information (usually parity bytes) is spread across an array of disk drives. When errors are discovered the redundant information can be used to restore the data and ....
G. Copeland, W. Alexander, E. Boughter, and T Keller, "Data placement in bubba,"in Proc. ACM-$IGMOD lnt. Conf. Management of Data, 1988.
Exploiting Advanced Database Optimization Features for.. - Zeller, Kemper (2002) (Correct)
....proposed a heuristic which provides an integrated solution to the query optimization and data allocation problems in distributed database systems. Copeland, Alexander, Bougther, and Teller investigated the problem of data placement in BUBBA, a highly parallel system for dataintensive applications [9, 2]. DeWitt et al. 10, 11, 12] described and evaluated the data placement strategies in GAMMA, a relational database machine where all data is partitioned horizontally. In [19] Mehta and DeWitt presented a simulation study of data placement issues in shared nothing systems. Another issue that is ....
G. Copeland, W. Alexander, E. Boughter, and T. Keller. Data placement in bubba. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 99--108, Chicago, IL, USA, May 1988.
A Case for Fractured Mirrors - Ramamurthy, DeWitt, Su (2002) (9 citations) (Correct)
....benchmark has also been carried out in [22] using the Monet main memory database system. Some of the very early prototype database systems that hinted at using decomposed storage were [19] 20] The BUBBA project was among the better known projects that advocated the use of DSM. The BUBBA system [7] proposed a notion of using a set of inverted files and a remainder relation as an online copy instead of mirroring. DSM has also been used as a physical storage model to implement object oriented data models. Query rewriting schemes for translating queries on an object based model into DSM is ....
G.P.Copeland, W.Alexander, E.E.Boughter, T.W.Keller. Data Placement in BUBBA. Proceedings of ACM SIGMOD 1988.
The Comfort Automatic Tuning Project - Weikum, Hasse, Monkeberg, Zabback (1994) (15 citations) (Correct)
....usually leading to reorganizations such as re loading the database. The key issue at this stage is physical database design (index selection, file placement, etc. A large body of research has been carried out in this area, and there is some work that has resulted in practical tuning tools (e.g. [14], 28] 64] 67] 70] 94] A major shortcoming of this work is that it does not take into account the performance issues that arise in multi user operation. For example, in making the decision about whether an index should be created or not, even the best optimization models would merely ....
G. Copeland, W. Alexander, E. Boughter and T. Keller. Data Placement in Bubba. ACM SIGMOD International Conference on Management of Data, Chicago (1988).
A Fast Convergence Technique for Online Heatbalancing of .. - Feelifl, Kitsuregawa.. (2000) (Correct)
....new distribution and making the work migrating decision, and the actual data migration. In this section, we first clarify our consideration to the workload. Then we present a new algorithm to calculate a new heat distribution from the current one The workload is reflected by a metric, called heat [3]. We define the heat of a range R = Rmin . Rmax as the access frequency of R during a certain period of time. A range R as a logical quantity can be determined by any physical object in the system such as a data page, an index branch, and an index (sub)tree. The cost of maintaining heat ....
Copeland, G., Alexander, W., Boughter, E., Keller, T.: Data Placement in Bubba. Proc. of ACM SIGMOD Conference, pages 99-108, (1988)
Locking Protocols for Two-Tier Indexing of Partitioned Data - Choy, Mohan (1993) (2 citations) (Correct)
....a Two Tier Index 5 These advantages are quite obvious and examples would be trivial. In addition, the two tier indexing method has the following architectural advantages: More scalable than the Local Index Only solution . Compatible with any data partitioning scheme and clustering scheme [CoAl88, DeGh90] No separate logic needed to handle query broadcast, which is necessary to support search on an un indexed field, and no special treatment needed for indexing the Partition Key . Accommodate node heterogeneity and autonomy for a distributed database . Easier for a conventional, ....
Copeland, G., Alexander, W., Boughter, E., and Keller, T., Data Placement in Bubba, Proc. ACM-SIGMOD International Conference on Management of Data, Chicago, May 1988.
Parallelism In Xprs - Michael Stonebraker Paul (1989) (4 citations) (Correct)
....in [STON88] and one on the reliable disk system in [PATT88] This paper explores the file system that we are constructing and the novel way we will obtain intra query parallelism in the resulting system. Recent systems that exploited intra query parallelism include Gamma [DEWI86, DEWI88] Bubba [COPE88], Non stop SQL [GRAY87, BORR88] and the Teradata 1012 [TERA85] Earlier approaches to parallelism included those of Distributed INGRES [STON83] and SDD 1 [ROTH80] All of the above systems can be classified as shared nothing systems [STON86] and have the common characteristic that intra query ....
....multiple computations. Likewise, data tuples must sometimes be sent to other sites, again generating message traffic. This has prompted Bubba to advocate spreading data over less than all sites to lower the amount of intra query parallelism that can be used so that the number of messages declines [COPE88]. Since XPRS is a shared memory system, neither of these disadvantages need be experienced. A shared memory system will automatically allocate the next computation to the first available processor, and automatic CPU load balancing is obtained. Moreover, we will indicate in Section 2 the design of ....
Copeland, G. et. al., "Data Placement in Bubba," Proc. 1988 ACM-SIGMOD Conference on Management of Data, Chicago, Il. June 1988.
C-Store: A Column-oriented DBMS - Mike Stonebraker Daniel (2005) (Correct)
No context found.
George Copeland et. al. Data Placement in Bubba. In Proceedings SIGMOD 1988.
Conflict-Aware Replication for Dynamic Content Web Sites - Amza (2003) (1 citation) (Correct)
No context found.
G. Copeland, W. Alexander, E. Boughter, and T. Keller. Data placement in Bubba. In Proceedings of Association for Computing Machinery Special Interest Group on Management of Data, pages 99-108, June 1988. 108
Parallel Database Systems: The Future of Database Processing.. - DeWitt, Gray (1991) (27 citations) (Correct)
No context found.
Copeland, G., Alexander, W., Boughter, E., and T. Keller, "Data Placement in Bubba," Proceedings of the ACM-SIGMOD International Conference on Management of Data, Chicago, May 1988.
Scaling and Availability for Dynamic Content Web Sites - Amza, Cox, Zwaenepoel (2002) (Correct)
No context found.
George Copeland, William Alexander, Ellen Boughter, and Tom Keller. Data placement in Bubba. In Proceedings of Association for Computing Machinery Special Interest Group on Management of Data, pages 99-108, June 1988.
Scaling e-Commerce Sites - Amza, Cox, Zwaenepoel (Correct)
No context found.
George Copeland, William Alexander, Ellen Boughter, and Tom Keller. Data placement in Bubba. In Proceedings of Association for Computing Machinery Special Interest Group on Management of Data, pages 99-108, June 1988.
A Parallel Algebra For Object Databases - Sandra De Mendes (Correct)
No context found.
G. Copeland, W. Alexander, E. Boughter, and T. Keller. Data placement in Bubba. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 99--108, Chicago, May 1988.
Online Balancing of Range-Partitioned Data with.. - Ganesan, Bawa.. (2004) (9 citations) (Correct)
No context found.
G. Copeland, W. Alexander, E. Boughter, and T. Keller. Data placement in Bubba. In Proc. SIGMOD, 1988.
Performance Modeling of the Grace Hash Join on Cluster.. - Erich Schikuta Institut (2003) (Correct)
No context found.
G. Copeland, W. Alexander, E. Boughter, and T. Keller. Data placement in bubba. In Proc. Of the ACM-SIGMOD Int. Conf. On Management of Data. ACM, 1988.
Conflict-Aware Replication for Dynamic Content Web Sites - Amza (2003) (1 citation) (Correct)
No context found.
G. Copeland, W. Alexander, E. Boughter, and T. Keller. Data placement in Bubba. In Proceedings of Association for Computing Machinery Special Interest Group on Management of Data, pages 99-108, June 1988. 108
Design and Implementation of Scalable Tape Archiver - Toshihiro Nemoto Masaru (1996) (Correct)
No context found.
Copeland, W. Alexander, E. Boughter, and T. Keller. "Data placement in bubba." Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, pp. 99-109, 1088
Scaling and Availability for Dynamic Content Web Sites - Amza, Cox, Zwaenepoel (2002) (Correct)
No context found.
George Copeland, William Alexander, Ellen Boughter, and Tom Keller. Data placement in Bubba. In Proceedings of Association for Computing Machinery Special Interest Group on Management of Data, pages 99-108, June 1988.
Effective load-balancing of peer-to-peer systems - Mondal, Goda, Kitsuregawa (2003) (1 citation) (Correct)
No context found.
G. Copeland, W. Alexander, E. Boughter, and T. Keller. Data placement in Bubba. SIGMOD Record ACM, 17(3):99--108, 1988.
Scaling e-Commerce Sites - Amza, Cox, Zwaenepoel (Correct)
No context found.
George Copeland, William Alexander, Ellen Boughter, and Tom Keller. Data placement in Bubba. In Proceedings of Association for Computing Machinery Special Interest Group on Management of Data, pages 99-108, June 1988.
A Mixed Fragmentation Methodology for Initial Distributed .. - Navathe, Karlapalem, Ra (1995) (8 citations) (Correct)
No context found.
G. Copeland, W. Alexander, E. Boughter, and T. Keller, "Data placement in bubba," in Proceedings of ACM SIGMOD International Conference on Management of Data, 1988.
File Assignment in Parallel I/O Systems with Minimal.. - Lee, Scheuermann.. (Correct)
No context found.
G. Copeland, W. Alexander, E. Bougher, and T. Keller. Data placement in Bubba. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 1988.
An Analytical Tool for Predicting the - Performance Of Parallel (Correct)
No context found.
G. Copeland, W. Alexander, E. Boughter and T. Keller. "Data placement in Bubba" (1988) Proceedings of ACM SIGMOD Conference
A Performance Analysis of Alternative Multi-Attribute.. - Ghandeharizadeh, DeWitt (1992) (17 citations) (Correct)
No context found.
G. Copeland, W. Alexander, E. Boughter, and T. Keller. Data placement in bubba. Procedings of the ACM-SIGMOD International Conference on Management of Data, June 1988.
Performance Evaluation of Cassette Migration Mechanism - For Scalable Tape (1995) (Correct)
No context found.
G. Copeland, W. Alexander, E. Boughter, and T. Keller. "Data placement in bubba". In Proceedings of the
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC