STONEBRAKER , M., AND HELLERSTEIN, J., Eds. Readings in Database Systems, third ed. Morgan Kaufmann, 1998.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and promotes commercialization, broad application, and wide acceptance of the technology. In this sense, the success of the relational systems should be credited in part to the standardization of relational query languages, which was done at the early stage in the development of the field [20]. The recent standardization activities in database systems, such as the work related to SQL 3, OMG and ODMG [3] show again the importance of a standard database Research was supported in part by the grant NSERC A3723 from the NaturM Sciences and Engineering Research Council of Canada, the grant ....

M. Stonebraker. Readings in Database Systems, 2ed. Morgan Kaufmann, 1993.

....been a challenging problem since the early days of distributed database systems. Semantic heterogeneity has been investigated as part of all major information system architectures during the last three decades. The terms may have changed from semantic mismatch [3] and semantic inconsistency [9] to merging ontologies and ontology alignment [8] but the underlying problem of appropriately integrating information from di#erent sources using di#erent concepts, assumptions, and languages, remains. Indeed, with global inter connectivity, the issue is more important and intractable now ....

M. Stonebraker. Readings in Database Systems. Morgan Kaufmann, CA, 1984.

....on whether the similarity predicate implies that the cache value is good enough. 2.4 The Execution Engine The execution engine carries out the execution of SQL statements. For clarity of explanation, let us first recall the typical steps to process an SQL query in a conventional database [8]: 1. Map textual query to intermediate form called a query graph. 2. Map query graph into a expression called a logical access plan. 3. Convert logical access plan into a physical plan. 4. Generate the space of equivalent physical plans. 5. Estimate the cost of a physical plan. 6. ....

M. Stonebraker. Readings in database Systems. Morgan Kaufmann Publishers, 1994.

.... the query, and (2) the application itself need not contain #################################### 2 Readers unfamiliar with DBMS concepts, particularly those of relational systems, should consult one of the standard introductions to the subject (e.g. DATE90] More experienced readers may find [STON88] useful, as it provides a selection of papers that tend to focus on the kind of implementation issues to which we allude in this paper. assumptions about the physical storage of the data and so need not be rewritten when the storage method is changed. Relational systems are typically implemented ....

M. Stonebraker, ed., Readings in Database Systems, Morgan Kauffman, San Mateo, CA, 1988.

....1. Concurrency controls and recovery mechanisms. 2. Access plan optimizers. 3. E#cient data processing algorithms. 4. The client server computing paradigm. 5. Massive vendor marketing and sales e#orts. Although these factors have made RDBMS technology into a multi billion dollar industry [33, 37], there are still several areas where this model can be substantially improved. In particular, it is still fairly di#cult to write applications that use an RDBMS due to the impedance mismatch [8] between the set based relational model and tuple at a time procedural languages used to write ....

.... SDD 1 [4] and distributed INGRES [10] These prototypes developed techniques for distributed query optimization and execution, distributed transactions, and distributed data (partitioning and replication) To some extent, these prototypes were ahead of their time, and failed to be widely accepted [37] for a number of reasons, including the lack of robust and e#cient networking protocols in their operating systems. More recently, newer distributed database systems have become very popular, with most commercial systems o#ering some form of distributed query processing [24] There are also ....

Michael Stonebraker and Joseph M. Hellerstein, editors. Readings in Database Systems. Morgan Kaufmann Publishers, San Francisco, CA, 1998.

....6.7. Conclusions The history of DBMS research is littered with innumerable proposals to construct hardware database machines to provide high performance operations. In general these have been proposed by hardware types with a clever solution in search of a problem on which it might work. [96] As this quote indicates, work on database machines has a checkered past, causing some to doubt this new line of research. We view this skepticism as healthy, and in overcoming our own doubts we have become increasingly convinced that intelligent disks can be efficient and cost effective in the ....

M. Stonebraker, editor. Readings in Database Systems, second edition, Morgan Kaufmann Publishers, San Francisco, page 603, 1994.

....as the network becomes a bottleneck. Therefore, the scalability of a shared memory system is rather low. Also, a memory fault may affect most of the processors when the faulted module is a shared memory space, so reducing the data availability. Examples of shared memory PDSs are the XPRS system [76], DBS3 [6] Volcano [33] and Sybase ASE 11.5. In summary, the shared memory architecture is a satisfactory solution when the PDS maintains coarse granularity parallelism. 4.2.2 Shared Disk Architecture In a shared disk architecture, each processor has a private memory and can access all the ....

M. Stonebraker, editor. Readings in Database Systems. Morgan--Kauffman, San Mateo, CA, 1988.

....methods of spatial data mining. Spatial data mining, or knowledge discovery in spatial database, refers to the extraction of implicit knowledge, spatial relations, or other patterns not explicitly stored in spatial databases [88] Previous works in machine learning [48, 104, 107] database systems [137], and statistics [26, 49, 79, 128] laid the foundation for research into knowledge discovery in databases. Advances in the research on spatial data structures and spatial databases enable the efficient querying of large spatial databases [19, 34, 59] These advances, in combination with the ....

M. Stonebraker. Readings in Database Systems, 2ed. Morgan Kaufmann, 1993.

....of commercial products. The strength of the OO1 benchmark lies in its simplicity, and it s realism (due to early interviews with users during its design) particularly for ECAD applications. Weaknesses include complaints about allowing unprotected access to the data (Introduction to Chapter 6 of [Stonebraker, M. Ed. 1994]) The OO7 benchmark attempts to generalize the measurement of OODBS capabilities and cover a number of capabilities not treated by OO1. For example, many OODBS commercial offerings have turned out to be deficient in query capabilities, since they lack some of the structure expected for ....

....Think time. The time taken by an emulated terminal in a benchmark simulation between receiving a reply from one request and sending the next request. TP1 benchmark. Batch version of DebitCredit [Serlin, Omri, 1993] Sometimes referred to loosely (for example in the Chapter 6 introduction to [Stonebraker, M. Ed) 1994] as the third performance test in [Anon et al. 1985] that is not Sort or Scan. tps. Benchmark rating unit for the number of transactions per second a system can provide. Transaction processing. Subsumed under the term database processing in this article. Workload. For a database application at ....

Stonebraker, M. (Ed.) 1994. Readings in Database Systems, 2nd ed. Morgan Kaufmann.

....get high performance. To benefit from RAID technology, the write blocks has to be much larger than those used in traditional systems. In addition, in normal systems, sequential writes are only about 3 5 times faster than random writes, while in RAID, sequential writes can be up to 20 times faster [7]. Super Computing Applications. In many super computing applications, computations are done on large matrixes and arrays. To be able to do operations on these large structures, it is often necessary to break them into chunks which can be processed independently. It is necessary to retrieve and ....

M. Stonebraker. Readings in Database Systems (2nd edition). Morgan Kaufmann, 1994.

No context found.

M. Stonebraker and J. M. Hellerstein, editors. Readings in Database Systems, Third Edition. Morgan Kaufmann, San Francisco, 1998.

No context found.

STONEBRAKER , M., AND HELLERSTEIN, J., Eds. Readings in Database Systems, third ed. Morgan Kaufmann, 1998.

No context found.

M. Stonebraker and J. Hellerstein, editors. Readings in Database Systems, chapter 3. Morgan Kaufmann Publishers, Inc., 3rd edition, 1998.

No context found.

Stonebraker, M. (ed.), Readings in Database Systems, Morgan Kaufmann, San Francisco, CA, 1994.

No context found.

M. Stonebraker and J. Hellerstein, editors. Readings in Database Systems, chapter 3. Morgan Kaufmann Publishers, Inc., 3rd edition, 1998.

No context found.

M. Stonebraker. Readings in Database Systems. Morgan Kaufmann, 1988.

No context found.

Stonebraker, M. Readings in Database Systems, 2ed.. Morgan Kaufmann, 1993.

No context found.

Stonebraker, M. Readings in Database Systems. Morgan Kaufmann, 1988.

No context found.

M. Stonebraker. Readings in Database Systems. Morgan Kaufmann, 1988.

No context found.

Stonebraker, M., editor. Readings in Database Systems. Morgan Kaufmann. 1988.

No context found.

Michael Stonebraker, editor. Readings in Database Systems. Morgan Kaufmann, 1994.

No context found.

M. Stonebraker, editor. Readings in Database Systems. Morgan Kaufmann, 1994.

No context found.

M. Stonebraker, editor. Readings in Database Systems. Morgan Kaufmann Publ., 1988.

No context found.

Michael Stonebraker, editor. Readings in Database Systems. Morgan Kaufmann, 1988.

No context found.

Michael Stonebraker, editor. Readings in Database Systems. Morgan Kaufmann, 1988.

First 50 documents

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