Trends in Storage Technologies

The popularity of location-based services and the need to perform real-time processing on them has led to an interest in queries on road networks, such as finding shortest paths and finding nearest neighbors. The challenge here is that the efficient execution of operations usually involves the computation of distance along a spatial network instead of “as the crow flies,” which is not simple. This requires the precomputation of the shortest paths and network distance between every pair of points (i.e., vertices) with as little space as possible rather than having to store the n2 shortest paths and distances between all pairs. This problem is related to a ‘holy grail’ problem in databases of how to incorporate road networks into relational databases. A data structure called a road network oracle is introduced that resides in a database and enables the processing of many operations on road networks with just the aid of relational operators. Two implementations of road network oracles are presented.

[1]  Guido Torelli,et al.  A Bipolar-Selected Phase Change Memory Featuring Multi-Level Cell Storage , 2009, IEEE Journal of Solid-State Circuits.

[2]  R. Waser,et al.  Nanoionics-based resistive switching memories. , 2007, Nature materials.

[3]  Gregory S. Snider,et al.  ‘Memristive’ switches enable ‘stateful’ logic operations via material implication , 2010, Nature.

[4]  Zvonimir Z. Bandic,et al.  Advances in Magnetic Data Storage Technologies , 2008 .

[5]  Kailash Gopalakrishnan,et al.  Overview of candidate device technologies for storage-class memory , 2008, IBM J. Res. Dev..

[6]  Philip N. Klein,et al.  Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..

[7]  Kevin Judd,et al.  Scaling tape-recording areal densities to 100 Gb/in2 , 2008, IBM J. Res. Dev..

[8]  M. Hosomi,et al.  A novel nonvolatile memory with spin torque transfer magnetization switching: spin-ram , 2005, IEEE InternationalElectron Devices Meeting, 2005. IEDM Technical Digest..

[9]  S.W. Nam,et al.  High performance PRAM cell scalable to sub-20nm technology with below 4F2 cell size, extendable to DRAM applications , 2010, 2010 Symposium on VLSI Technology.

[10]  R. Meyer,et al.  Oxide dual-layer memory element for scalable non-volatile cross-point memory technology , 2008, 2008 9th Annual Non-Volatile Memory Technology Symposium (NVMTS).

[11]  Dorothea Wagner,et al.  Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs , 2003, ESA.

[12]  Winfried W. Wilcke,et al.  Storage-class memory: The next storage system technology , 2008, IBM J. Res. Dev..

[13]  Jian-Gang Zhu,et al.  Magnetoresistive Random Access Memory: The Path to Competitiveness and Scalability , 2008, Proceedings of the IEEE.

[14]  S. Takahashi,et al.  Lower-current and fast switching of a perpendicular TMR for high speed and high density spin-transfer-torque MRAM , 2008, 2008 IEEE International Electron Devices Meeting.

[15]  Hanan Samet,et al.  Distance Oracles for Spatial Networks , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[16]  Byung-Gil Choi,et al.  A 90 nm 1.8 V 512 Mb Diode-Switch PRAM With 266 MB/s Read Throughput , 2008, IEEE Journal of Solid-State Circuits.

[17]  Hanan Samet,et al.  Scalable network distance browsing in spatial databases , 2008, SIGMOD Conference.

[18]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[19]  Hanan Samet,et al.  Enabling Query Processing on Spatial Networks , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[20]  Heng Tao Shen,et al.  Monitoring path nearest neighbor in road networks , 2009, SIGMOD Conference.

[21]  Peter Sanders,et al.  In Transit to Constant Time Shortest-Path Queries in Road Networks , 2007, ALENEX.

[22]  Hanan Samet,et al.  Efficient query processing on spatial networks , 2005, GIS '05.

[23]  F. Benjamin Zhan,et al.  Shortest Path Algorithms: An Evaluation Using Real Road Networks , 1998, Transp. Sci..

[24]  Wu Zhe,et al.  Characteristics of Phase Change Memory Devices based on Ge-doped SbTe and its derivative , 2007 .

[25]  U-In Chung,et al.  A unified 7.5nm dash-type confined cell for high performance PRAM device , 2008, 2008 IEEE International Electron Devices Meeting.

[26]  Mikkel Thorup,et al.  Undirected single-source shortest paths with positive integer weights in linear time , 1999, JACM.

[27]  Chin-Wan Chung,et al.  An Efficient and Scalable Approach to CNN Queries in a Road Network , 2005, VLDB.

[28]  Pierre-Olivier Jubert,et al.  29.5- $\hbox{Gb/in}^{2}$ Recording Areal Density on Barium Ferrite Tape , 2015, IEEE Transactions on Magnetics.

[29]  Hanan Samet,et al.  Foundations of multidimensional and metric data structures , 2006, Morgan Kaufmann series in data management systems.

[30]  Arnon Amir,et al.  The Linear Tape File System , 2010, 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST).

[31]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1987, JACM.

[32]  Hanan Samet,et al.  Path Oracles for Spatial Networks , 2009, Proc. VLDB Endow..

[33]  S. Rao Kosaraju,et al.  Faster algorithms for some geometric graph problems in higher dimensions , 1993, SODA '93.

[34]  Hanan Samet,et al.  Query Processing Using Distance Oracles for Spatial Networks , 2010, IEEE Transactions on Knowledge and Data Engineering.

[35]  Elke A. Rundensteiner,et al.  Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation , 1998, IEEE Trans. Knowl. Data Eng..

[36]  P. J. Narayanan,et al.  Accelerating Large Graph Algorithms on the GPU Using CUDA , 2007, HiPC.

[37]  C. Gerber,et al.  Reproducible switching effect in thin oxide films for memory applications , 2000 .

[38]  Yufei Tao,et al.  Query Processing in Spatial Network Databases , 2003, VLDB.

[39]  Cyrus Shahabi,et al.  Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases , 2004, VLDB.

[40]  Cyrus Shahabi,et al.  A Road Network Embedding Technique for K-Nearest Neighbor Search in Moving Object Databases , 2003, GeoInformatica.

[41]  Hanan Samet,et al.  Distance join queries on spatial networks , 2006, GIS '06.

[42]  T Uruga,et al.  Toward the ultimate limit of phase change in Ge(2)Sb(2)Te(5). , 2010, Nano letters.