Sciweavers

Share
VLDB
2002
ACM
108views Database» more  VLDB 2002»
8 years 9 months ago
Energy-performance trade-offs for spatial access methods on memory-resident data
Abstract. The proliferation of mobile and pervasive computing devices has brought energy constraints into the limelight. Energy-conscious design is important at all levels of syste...
Ning An, Sudhanva Gurumurthi, Anand Sivasubramania...
CSUR
1998
99views more  CSUR 1998»
8 years 9 months ago
Multidimensional Access Methods
Search operations in databases require some special support at the physical level. This is true for conventional databases as well as for spatial databases, where typical search o...
Volker Gaede, Oliver Günther
JCST
2007
151views more  JCST 2007»
8 years 10 months ago
Indexing Future Trajectories of Moving Objects in a Constrained Network
Abstract Advances in wireless sensor networks and positioning technologies enable new applications monitoring moving objects. Some of these applications, such as traffic managemen...
Ji-Dong Chen, Xiao-Feng Meng
DEBU
2010
238views more  DEBU 2010»
8 years 10 months ago
Spatio-Temporal Access Methods: Part 2 (2003 - 2010)
In spatio-temporal applications, moving objects detect their locations via location-aware devices and update their locations continuously to the server. With the ubiquity and mass...
Long-Van Nguyen-Dinh, Walid G. Aref, Mohamed F. Mo...
BNCOD
2004
184views Database» more  BNCOD 2004»
8 years 11 months ago
Bulk Loading the M-Tree to Enhance Query Performance
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
Alan P. Sexton, Richard Swinbank
ICDE
1991
IEEE
145views Database» more  ICDE 1991»
9 years 1 months ago
DOT: A Spatial Access Method Using Fractals
Existing Database Management Systems (DBMSs) do not handle efficiently multi-dimensional data such as boxes, polygons, or even points in a multi-dimensional space. We examine acc...
Christos Faloutsos, Yi Rong
VLDB
2000
ACM
120views Database» more  VLDB 2000»
9 years 1 months ago
Integrating the UB-Tree into a Database System Kernel
Multidimensional access methods have shown high potential for significant performance improvements in various application domains. However, only few approaches have made their way...
Frank Ramsak, Volker Markl, Robert Fenk, Martin Zi...
EDBT
2000
ACM
9 years 1 months ago
Management and Query Processing of One-Dimensional Intervals with the UB-Tree
The management and query processing of one dimensional intervals is a special case of extended object handling. One dimensional intervals play an important role in temporal databa...
Robert Fenk
BTW
2003
Springer
94views Database» more  BTW 2003»
9 years 3 months ago
The Paradigm of Relational Indexing: a Survey
Abstract: In order to achieve efficient execution plans for queries comprising userdefined data types and predicates, the database system has to be provided with appropriate index ...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
DEXA
2007
Springer
141views Database» more  DEXA 2007»
9 years 4 months ago
Indexing Set-Valued Attributes with a Multi-level Extendible Hashing Scheme
We present an access method for set-valued attributes that is based on a multi-level extendible hashing scheme. This scheme avoids exponential directory growth for skewed data and...
Sven Helmer, Robin Aly, Thomas Neumann, Guido Moer...
books