A Spatial Indexing Approach for High Performance Location Based Services

2006 ◽  
Vol 60 (1) ◽  
pp. 83-93 ◽  
Author(s):  
Bo Huang ◽  
Qiang Wu
Keyword(s):  
High Performance ◽  
Rapid Development ◽  
Main Memory ◽  
Location Based Services ◽  
Index Structure ◽  
Hybrid Index ◽  
Indexing Methods ◽  
Effective Option ◽  
Upper Level ◽  
Data Update

The rapid development of positioning technology, wireless communication and mobile devices has given rise to the exciting Location Based Services (LBS) thus significantly influencing existing navigational procedures. Motivated by the increasing need to search efficiently through a huge number of service locations (e.g. restaurants, hotels, shops, and more), this paper presents an efficient spatial index QR-tree, a hybrid index structure of Quadtree and R-tree, instead of the exhaustive search to improve the performance in response to user queries. QR-tree consists of two levels: the upper level is a Quadtree residing in the main memory which partitions the data space and the lower level is disk-resident R-trees assigned to the subspaces resulting from the partitioning process. Computational experiments show that the hybrid index structure is able to reduce query response time by up to 30% and achieve significant improvement on data update over the conventional indexing methods, thereby providing an effective option for efficient navigation services.

Study and Optimization of T-Tree Index in Main Memory Database

2013 ◽  
Vol 427-429 ◽  
pp. 2531-2535 ◽  
Author(s):  
Feng Dong Sun ◽  
Quan Guo ◽  
Lan Wang
Keyword(s):  
High Performance ◽  
Main Memory ◽  
Memory Access ◽  
Index Structure ◽  
Index Structures ◽  
Clock Speed ◽  
Main Memory Database ◽  
Tree Index ◽  
Overall Performance

The bottleneck is not the disk I/O but CUP clock speed faster than the memory speed in main memory database .In order to achieve high performance in main memory database ,it is a good approach to design new index structures to improve the memory access speed .This chapter presents a T-tree index structure and its algorithms in main memory database firstly .Then presents two results on Optimization of T-tree index ,including T-tail tree and TTB-tree. Our results indicate that the T-Tree provides good overall performance in main memory.

scholarly journals TDCMR: Triplet-Based Deep Cross-Modal Retrieval for Geo-Multimedia Data

2021 ◽  
Vol 11 (22) ◽  
pp. 10803
Author(s):  
Jiagang Song ◽  
Yunwu Lin ◽  
Jiayu Song ◽  
Weiren Yu ◽  
Leyuan Zhang
Keyword(s):  
High Performance ◽  
Large Scale ◽  
Location Based Services ◽  
Multimedia Data ◽  
Multimedia Retrieval ◽  
Geographical Information ◽  
Superior Performance ◽  
Hybrid Index ◽  
High Level ◽  
Hash Codes

Mass multimedia data with geographical information (geo-multimedia) are collected and stored on the Internet due to the wide application of location-based services (LBS). How to find the high-level semantic relationship between geo-multimedia data and construct efficient index is crucial for large-scale geo-multimedia retrieval. To combat this challenge, the paper proposes a deep cross-modal hashing framework for geo-multimedia retrieval, termed as Triplet-based Deep Cross-Modal Retrieval (TDCMR), which utilizes deep neural network and an enhanced triplet constraint to capture high-level semantics. Besides, a novel hybrid index, called TH-Quadtree, is developed by combining cross-modal binary hash codes and quadtree to support high-performance search. Extensive experiments are conducted on three common used benchmarks, and the results show the superior performance of the proposed method.

Optimization of T-Tree Index of Main Memory Database in Critical Application

2010 ◽  
Vol 40-41 ◽  
pp. 206-211
Author(s):  
Zhi Lin Zhu
Keyword(s):  
Data Structures ◽  
High Performance ◽  
Main Memory ◽  
Ongoing Study ◽  
Index Structure ◽  
Index Structures ◽  
Main Memory Database ◽  
Data Structures And Algorithms ◽  
Tree Index ◽  
Overall Performance

One approach to achieving high performance in the DBMS in the critical application is to store the database in main memory rather than on disk. One can then design new data structures and algorithms oriented towards increasing the efficiency of the main memory database -MMDB. In this paper we present some results on index structures from an ongoing study of MMDB. We propose a new index structure, the T-tail Tree. We give the main algorithm of the T-tail Tree and the performance of these algorithms. Our results indicate that T-tail Tree provides good overall performance in main memory.

High performance location-based services in a main-memory database

2016 ◽  
Vol 21 (2) ◽  
pp. 293-322 ◽  
Author(s):  
Suprio Ray ◽  
Rolando Blanco ◽  
Anil K. Goel
Keyword(s):  
High Performance ◽  
Main Memory ◽  
Location Based Services ◽  
Main Memory Database

Surface/interface nanoengineering for rechargeable Zn–air batteries

2020 ◽  
Vol 13 (4) ◽  
pp. 1132-1153 ◽  
Author(s):  
Tianpei Zhou ◽  
Nan Zhang ◽  
Changzheng Wu ◽  
Yi Xie
Keyword(s):  
High Performance ◽  
Rapid Development

Surface/interface nanoengineering of electrocatalysts and air electrodes will promote the rapid development of high-performance rechargeable Zn–air batteries.

High Performance Thin Layer Chromatography (HPTLC) for the Investigation of Medicinal Plants

2020 ◽  
Vol 16 ◽  
Author(s):  
Alper Gökbulut
Keyword(s):  
Medicinal Plants ◽  
High Performance ◽  
Separation Efficiency ◽  
Rapid Development ◽  
Herbal Remedies ◽  
Qualitative And Quantitative ◽  
Powerful Analytical Tool ◽  
Quantitative Examination ◽  
Data Acquisition And Processing ◽  
Layer Chromatography

Background: Chromatographic techniques such as TLC basically and, HPLC, GC, HPTLC equipped with various detectors are most frequently used for the qualitative and quantitative examination of herbals. Method: An overview of the recent literature concerning the usage of HPTLC for the analysis of medicinal plants has been reviewed. Results: During the last decade/s, HPTLC, a modern, sophisticated and automatized TLC technique with better and advanced separation efficiency, detection limit, data acquisition and processing, has been used for the analysis of herbal materials and preparations since the rapid development of technology in chromatography world. HPTLC with various detectors is a powerful analytical tool especially for the phytochemical applications such as herbal drug quantification and fingerprint analysis. Conclusion: In this review, a latest perspective has been established and some of the previous studies were summarized for the usage of HPTLC in the analysis of herbal remedies, dietary supplements and nutraceuticals.

scholarly journals A RF Redundant TSV Interconnection for High Resistance Si Interposer

Micromachines ◽  
2021 ◽  
Vol 12 (2) ◽  
pp. 169
Author(s):  
Mengcheng Wang ◽  
Shenglin Ma ◽  
Yufeng Jin ◽  
Wei Wang ◽  
Jing Chen ◽  
...  
Keyword(s):  
Millimeter Wave ◽  
High Frequency ◽  
High Performance ◽  
Rapid Development ◽  
Coplanar Waveguide ◽  
Equivalent Circuit Model ◽  
High Resistivity ◽  
Performance Requirements ◽  
Wave Radar ◽  
Interconnect Design

Through Silicon Via (TSV) technology is capable meeting effective, compact, high density, high integration, and high-performance requirements. In high-frequency applications, with the rapid development of 5G and millimeter-wave radar, the TSV interposer will become a competitive choice for radio frequency system-in-package (RF SIP) substrates. This paper presents a redundant TSV interconnect design for high resistivity Si interposers for millimeter-wave applications. To verify its feasibility, a set of test structures capable of working at millimeter waves are designed, which are composed of three pieces of CPW (coplanar waveguide) lines connected by single TSV, dual redundant TSV, and quad redundant TSV interconnects. First, HFSS software is used for modeling and simulation, then, a modified equivalent circuit model is established to analysis the effect of the redundant TSVs on the high-frequency transmission performance to solidify the HFSS based simulation. At the same time, a failure simulation was carried out and results prove that redundant TSV can still work normally at 44 GHz frequency when failure occurs. Using the developed TSV process, the sample is then fabricated and tested. Using L-2L de-embedding method to extract S-parameters of the TSV interconnection. The insertion loss of dual and quad redundant TSVs are 0.19 dB and 0.46 dB at 40 GHz, respectively.

scholarly journals A Hybrid Approach Combining R*-Tree and k-d Trees to Improve Linked Open Data Query Performance

2021 ◽  
Vol 11 (5) ◽  
pp. 2405
Author(s):  
Yuxiang Sun ◽  
Tianyi Zhao ◽  
Seulgi Yoon ◽  
Yongju Lee
Keyword(s):  
Flash Memory ◽  
Query Language ◽  
Hybrid Approach ◽  
Open Data ◽  
Main Memory ◽  
Linked Open Data ◽  
Index Structure ◽  
Identification Algorithm ◽  
Distributed Computing Systems ◽  
Query Performance

Semantic Web has recently gained traction with the use of Linked Open Data (LOD) on the Web. Although numerous state-of-the-art methodologies, standards, and technologies are applicable to the LOD cloud, many issues persist. Because the LOD cloud is based on graph-based resource description framework (RDF) triples and the SPARQL query language, we cannot directly adopt traditional techniques employed for database management systems or distributed computing systems. This paper addresses how the LOD cloud can be efficiently organized, retrieved, and evaluated. We propose a novel hybrid approach that combines the index and live exploration approaches for improved LOD join query performance. Using a two-step index structure combining a disk-based 3D R*-tree with the extended multidimensional histogram and flash memory-based k-d trees, we can efficiently discover interlinked data distributed across multiple resources. Because this method rapidly prunes numerous false hits, the performance of join query processing is remarkably improved. We also propose a hot-cold segment identification algorithm to identify regions of high interest. The proposed method is compared with existing popular methods on real RDF datasets. Results indicate that our method outperforms the existing methods because it can quickly obtain target results by reducing unnecessary data scanning and reduce the amount of main memory required to load filtering results.

scholarly journals Selective caching: a persistent memory approach for multi-dimensional index structures

2021 ◽  
Author(s):  
Muhammad Attahir Jibril ◽  
Philipp Götze ◽  
David Broneske ◽  
Kai-Uwe Sattler
Keyword(s):  
Main Memory ◽  
Index Structure ◽  
Index Structures ◽  
Cloud Infrastructure ◽  
General Technique ◽  
Persistent Memory ◽  
The Cost ◽  
Cloud Applications ◽  
Memory Layout ◽  
Analytical Index

AbstractAfter the introduction of Persistent Memory in the form of Intel’s Optane DC Persistent Memory on the market in 2019, it has found its way into manifold applications and systems. As Google and other cloud infrastructure providers are starting to incorporate Persistent Memory into their portfolio, it is only logical that cloud applications have to exploit its inherent properties. Persistent Memory can serve as a DRAM substitute, but guarantees persistence at the cost of compromised read/write performance compared to standard DRAM. These properties particularly affect the performance of index structures, since they are subject to frequent updates and queries. However, adapting each and every index structure to exploit the properties of Persistent Memory is tedious. Hence, we require a general technique that hides this access gap, e.g., by using DRAM caching strategies. To exploit Persistent Memory properties for analytical index structures, we propose selective caching. It is based on a mixture of dynamic and static caching of tree nodes in DRAM to reach near-DRAM access speeds for index structures. In this paper, we evaluate selective caching on the OLAP-optimized main-memory index structure Elf, because its memory layout allows for an easy caching. Our experiments show that if configured well, selective caching with a suitable replacement strategy can keep pace with pure DRAM storage of Elf while guaranteeing persistence. These results are also reflected when selective caching is used for parallel workloads.

Sign in / Sign up

Export Citation Format

Share Document