| |
Browse All Reviews > Information Systems (H) > Database Management (H.2) > Physical Design (H.2.2) > Access Methods (H.2.2...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 22
Reviews about "Access Methods (H.2.2...)":
|
Date Reviewed |
| |
Ontology-based data access systems
Kogalovsky M. Programming and Computing Software 38(4): 167-182, 2012. Type: Article
Intended as a survey, this paper presents a historical glance at database management systems and their design going back to the 1960s....
|
Mar 5 2013 |
| |
Load balancing and range queries in P2P systems using P-Ring
Crainiceanu A., Linga P., Machanavajjhala A., Gehrke J., Shanmugasundaram J. ACM Transactions on Internet Technology 10(4): 1-30, 2011. Type: Article
P-Ring is a new peer-to-peer (P2P) index structure. This paper introduces and describes this fully distributed, fault-tolerant structure that provides load balancing and logarithmic search performance while supporting both equality and...
|
Sep 23 2011 |
| |
R-trees: theory and applications (Advanced Information and Knowledge Processing)
Manolopoulos Y., Nanopoulos A., Papadopoulos A., Theodoridis Y., Springer-Verlag New York, Inc., Secaucus, NJ, 2005. 194 pp. Type: Book (9781852339777)
Spatial data management has been an area of intensive research for more than two decades. The complex nature of data required by many applications that we use today—such as geographic information systems (GIS), computer-a...
|
Dec 5 2006 |
| |
On a model of indexability and its bounds for range queries
Hellerstein J., Koutsoupias E., Miranker D., Papadimitriou C., Samoladas V. Journal of the ACM 49(1): 35-55, 2002. Type: Article
In this paper, the authors introduce a new framework for the modeling of indexing on block-access external devices such as hard disks. The authors define an indexing workload as a data set and the associated set of potential queries....
|
Aug 12 2002 |
| |
Estimating accesses in partitioned signature file organizations
Ciaccia P., Zezula P. ACM Transactions on Information Systems 11(2): 133-142, 1993. Type: Article
Quick filter (QF), or linear hashing with superimposed signatures [1], and fixed prefix (FP) [2] are two methods for signature file partitioning. QF and FP are designed for dynamic and static environments, respectively....
|
Dec 1 1993 |
| |
A Contingency Approach to Estimating Record Selectivities
Chu P. IEEE Transactions on Software Engineering 17(6): 544-552, 1991. Type: Article
Chu continues the exploration of record selection estimation techniques. His approach is a compromise between previously described parametric and nonparametric methods. Parametric methods assume that the distribution of attribute value...
|
Jul 1 1993 |
| |
An incremental access method for ViewCache: concept, algorithms, and cost analysis
Roussopoulos N. ACM Transactions on Database Systems 16(3): 535-563, 1991. Type: Article
Views in database systems are a convenient mechanism for providing alternative perspectives on database relations. Because views are not stored as such but rather are materialized as needed, the use of views can involve extensive compu...
|
Jun 1 1992 |
| |
A dynamic hash method with signature
Cesarini F., Soda G. ACM Transactions on Database Systems 16(2): 309-337, 1991. Type: Article
The authors present “a dynamic external hash method that allows retrieval of a record by only one access to mass storage while maintaining a high load factor.” The single access to mass storage is obtained by keepin...
|
Mar 1 1992 |
| |
Optimal Selection of Secondary Indexes
Barcucci E., Pinzani R., Sprugnoli R. IEEE Transactions on Software Engineering 16(1): 32-38, 1990. Type: Article
One of the most important tasks of a relational database administrator is the judicious creation of secondary indexes in order to maximize the overall performance of the database. This paper presents a heuristic method for choosing a s...
|
Mar 1 1991 |
| |
An Effective Approach to Vertical Partitioning for Physical Design of Relational Databases
Cornell D., Yu P. (ed) IEEE Transactions on Software Engineering 16(2): 248-258, 1990. Type: Article
The authors obtain the most significant performance improvements when the partitioning reduces the number of major steps in query processing; namely, when the inner relation in an inner-outer loop join, once partitioned, fits into the ...
|
Dec 1 1990 |
| |
|
|
| |
|
|
