An algorithm for displaying a class of space-filling curves
Software—Practice & Experience
Query processing in main memory database management systems
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
The BANG file: A new kind of grid file
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
A population analysis for hierarchical data structures
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
The design and analysis of spatial data structures
The design and analysis of spatial data structures
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The hB-tree: a multiattribute indexing method with good guaranteed performance
ACM Transactions on Database Systems (TODS)
A qualitative comparison study of data structures for large line segment databases
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Database system issues in nomadic computing
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Energy efficient indexing on air
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
A data cache with multiple caching strategies tuned to different types of locality
ICS '95 Proceedings of the 9th international conference on Supercomputing
A model for the prediction of R-tree performance
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Low power design in deep submicron electronics
Multidimensional access methods
ACM Computing Surveys (CSUR)
ISLPED '99 Proceedings of the 1999 international symposium on Low power electronics and design
Way-predicting set-associative cache for high performance and low energy consumption
ISLPED '99 Proceedings of the 1999 international symposium on Low power electronics and design
Direct spatial search on pictorial databases using packed R-trees
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Energy-driven integrated hardware-software optimizations using SimplePower
Proceedings of the 27th annual international symposium on Computer architecture
Multidimensional binary search trees used for associative searching
Communications of the ACM
Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Power-aware partitioned cache architectures
ISLPED '01 Proceedings of the 2001 international symposium on Low power electronics and design
Hardware and Software Techniques for Controlling DRAM Power Modes
IEEE Transactions on Computers
Low Power Digital CMOS Design
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
M32R/D-Integrating DRAM and Microprocessor
IEEE Micro
Spatial Databases-Accomplishments and Research Needs
IEEE Transactions on Knowledge and Data Engineering
Performance of Nearest Neighbor Queries in R-Trees
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Algorithms for Querying by Spatial Structure
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
DBMSs on a Modern Processor: Where Does Time Go?
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Efficient Processing of Spatial Queries in Line Segment Databases
SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
Performance Comparison of Segment Access Methods Implemented on Top of the Buddy-Tree
SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
VLSID '01 Proceedings of the The 14th International Conference on VLSI Design (VLSID '01)
DRAM Energy Management Using Sof ware and Hardware Directed Power Mode Control
HPCA '01 Proceedings of the 7th International Symposium on High-Performance Computer Architecture
Efficient database support for spatial applications
Efficient database support for spatial applications
Reducing energy consumption of queries in memory-resident database systems
Proceedings of the 2004 international conference on Compilers, architecture, and synthesis for embedded systems
Energy management schemes for memory-resident database systems
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Improving Energy-Efficiency of Grid Computing Clusters
GPC '09 Proceedings of the 4th International Conference on Advances in Grid and Pervasive Computing
Hi-index | 0.01 |
The proliferation of mobile and pervasive computing devices has brought energy constraints into the limelight. Energy-conscious design is important at all levels of system architecture, and the software has a key role to play in conserving battery energy on these devices. With the increasing popularity of spatial database applications, and their anticipated deployment on mobile devices (such as road atlases and GPS-based applications), it is critical to examine the energy implications of spatial data storage and access methods for memory resident datasets. While there has been extensive prior research on spatial access methods on resource-rich environments, this is, perhaps, the first study to examine their suitability for resource-constrained environments. Using a detailed cycle-accurate energy estimation framework and four different datasets, this paper examines the pros and cons of three previously proposed spatial indexing alternatives from both the energy and performance angles. Specifically, the Quadtree, Packed R-tree, and Buddy-Tree structures are evaluated and compared with a brute-force approach that does not use an index. The results show that there are both performance and energy trade-offs between the indexing schemes for the different queries. The nature of the query also plays an important role in determining the energy-performance trade-offs. Further, technological trends and architectural enhancements are influencing factors on the relative behavior of the index structures. The work in the query has a bearing on how and where (on a mobile client or/and on a server) it should be performed for performance and energy savings. The results from this study will be beneficial for the design and implementation of embedded spatial databases, accelerating their deployment on numerous mobile devices.