Results 1 - 10 of 1,566

Answering Queries Using Views: A Survey

by Alon Y. Halevy , 2000
"... The problem of answering queries using views is to find efficient methods of answering a query using a set of previously defined materialized views over the database, rather than accessing the database relations. The problem has recently received significant attention because of its relevance to a w ..."
Abstract - Cited by 562 (32 self) - Add to MetaCart
wide variety of data management problems. In query optimization, finding a rewriting of a query using a set of materialized views can yield a more efficient query execution plan. To support the separation of the logical and physical views of data, a storage schema can be described using views over

Uniprocessor Garbage Collection Techniques

by Paul R. Wilson - SUBMITTED TO ACM COMPUTING SURVEYS
"... We survey basic garbage collection algorithms, and variations such as incremental and generational collection; we then discuss low-level implementation considerations and the relationships between storage management systems, languages, and compilers. Throughout, we attempt to present a uni ed view b ..."
Abstract - Cited by 461 (5 self) - Add to MetaCart
We survey basic garbage collection algorithms, and variations such as incremental and generational collection; we then discuss low-level implementation considerations and the relationships between storage management systems, languages, and compilers. Throughout, we attempt to present a uni ed view

A Methodology for Implementing Highly Concurrent Data Objects

by Maurice Herlihy , 1993
"... A concurrent object is a data structure shared by concurrent processes. Conventional techniques for implementing concurrent objects typically rely on critical sections: ensuring that only one process at a time can operate on the object. Nevertheless, critical sections are poorly suited for asynchro ..."
Abstract - Cited by 350 (10 self) - Add to MetaCart
A concurrent object is a data structure shared by concurrent processes. Conventional techniques for implementing concurrent objects typically rely on critical sections: ensuring that only one process at a time can operate on the object. Nevertheless, critical sections are poorly suited

The HP AutoRAID hierarchical storage system

by John Wilkes, Richard Golding, Carl Staelin, Tim Sullivan - ACM Transactions on Computer Systems , 1995
"... Configuring redundant disk arrays is a black art. To configure an array properly, a system administrator must understand the details of both the array and the workload it will support. Incorrect understanding of either, or changes in the workload over time, can lead to poor performance. We present a ..."
Abstract - Cited by 263 (15 self) - Add to MetaCart
excellent storage cost for inactive data, at somewhat lower performance. The technology we describe in this paper, known as HP AutoRAID, automatically and transparently manages migration of data blocks between these two levels as access patterns change. The result is a fully redundant storage system

P-Grid: A self-organizing access structure for P2P information systems

by Karl Aberer - In CoopIS , 2001
"... Peer-To-Peer systems are driving a major paradigm shift in the era of genuinely distributed computing. Gnutella is a good example of a Peer-To-Peer success story: a rather simple software enables Internet users to freely exchange files, such as MP3 music files. But it shows up also some of the limit ..."
Abstract - Cited by 304 (49 self) - Add to MetaCart
of the limitations of current P2P information systems with respect to their ability to manage data eÆciently. In this paper we introduce P-Grid, a scalable access structure that is specifically designed for Peer-To-Peer information systems. P-Grids are constructed and maintained by using randomized algorithms

List Processing in Real Time on a Serial Computer

by Henry G. Baker - SERIAL COMPUTER, COMM. ACM , 1977
"... A real-time list processing system is one in which the time required by the elementary list operations (e.g. CONS, CAR, COR, RPLACA, RPLACD, EQ, and ATOM in LISP) is bounded by a (small) constant. Classical implementations of list processing systems lack this property because allocating a list cell ..."
Abstract - Cited by 228 (14 self) - Add to MetaCart
locations to avoid fragmenting the free storage pool. The program is small and requires no time-sharing interrupts, making it suitable for microcode. Finally, the system requires the same average time, and not more than twice the space, of a classical implementation, and those space requirements can

System R: Relational Approach to Database Management

by M. M. Astrahan, Ht. W. Blasgen, D. D. Chamberlin, K. P. Eswaran, J. N. Gray, P. P. Griffiths, W. F. King, R. A. Lorie, J. W. Mehl, G. R. Putzolu, I. L. Traiger, B. W. Wade, V. Watson - ACM Transactions on Database Systems , 1976
"... System R is a database management system which provides a high level relational data interface. The system provides a high level of data independence by isolating the end user as much as possible from underlying storage structures. The system permits definition of a variety of relational views on co ..."
Abstract - Cited by 174 (1 self) - Add to MetaCart
System R is a database management system which provides a high level relational data interface. The system provides a high level of data independence by isolating the end user as much as possible from underlying storage structures. The system permits definition of a variety of relational views

Packet-Level Traffic Measurements from the Sprint IP Backbone

by Chuck Fraleigh, Sue Moon, Bryan Lyles, Chase Cotton, Mujahid Khan, Deb Moll, Rob Rockell, Ted Seely, Christophe Diot - IEEE Network , 2003
"... Network traffic measurements provide essential data for networking research and network management. In this paper we describe a passive monitoring system designed to capture GPS synchronized packet level traffic measurements on OC-3, OC-12, and OC-48 links. Our system is deployed in four POPs in the ..."
Abstract - Cited by 196 (12 self) - Add to MetaCart
Network traffic measurements provide essential data for networking research and network management. In this paper we describe a passive monitoring system designed to capture GPS synchronized packet level traffic measurements on OC-3, OC-12, and OC-48 links. Our system is deployed in four POPs

An Energy Efficient Time-sharing Pyramid Pipeline for Multi-resolution Computer Vision

by Qiuling Zhu, Navjot Garg, Yun-ta Tsai, Kari Pulli
"... Abstract—We introduce an energy efficient time-sharing pyramid pipeline architecture designed for multi-resolution image analysis in mobile computer vision. The time-sharing pipeline efficiently reduces the off-chip memory traffic by re-organizing the data storage and processing order of an image py ..."
Abstract - Add to MetaCart
pipeline implementation. We also implement the multi-resolution Lucas-Kanade optical flow algorithm on the time-sharing pipeline, and demonstrate an order of magnitude savings in off-chip memory traffic and system energy consumption. Index Terms—time-sharing; pipeline; image pyramid; multiresolution

Lottery and Stride Scheduling: Flexible Proportional-Share Resource Management

by Carl A. Waldspurger - , 1995
"... This thesis presents flexible abstractions for specifying resource management policies, together with efficient mechanisms for implementing those abstractions. Several novel scheduling techniques are introduced, including both randomized and deterministic algorithms that provide proportional-share c ..."
Abstract - Cited by 151 (4 self) - Add to MetaCart
This thesis presents flexible abstractions for specifying resource management policies, together with efficient mechanisms for implementing those abstractions. Several novel scheduling techniques are introduced, including both randomized and deterministic algorithms that provide proportional-share
Results 1 - 10 of 1,566