To see the other types of publications on this topic, follow the link: Data models, storage and indexing.

Journal articles on the topic 'Data models, storage and indexing'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Data models, storage and indexing.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Vegesna, Rohith Varma. "Designing an Archival System for Long-Term Fuel System Data Analysis." International Scientific Journal of Engineering and Management 03, no. 09 (2024): 1–3. https://doi.org/10.55041/isjem02155.

Full text
Abstract:
The increasing volume of fuel transaction data necessitates efficient long-term archival solutions to enable historical analysis, regulatory compliance, and anomaly detection. Traditional storage methods may become inefficient due to high storage costs and data retrieval latencies, especially as fuel stations generate continuous data streams. This paper proposes an archival system designed to store and retrieve long-term fuel transaction data efficiently, ensuring optimized performance without unnecessary overhead. Leveraging tiered storage models, metadata indexing, and cloud- based solutions
APA, Harvard, Vancouver, ISO, and other styles
2

Wang, Zhaoguo, Haibo Chen, Youyun Wang, Chuzhe Tang, and Huan Wang. "The Concurrent Learned Indexes for Multicore Data Storage." ACM Transactions on Storage 18, no. 1 (2022): 1–35. http://dx.doi.org/10.1145/3478289.

Full text
Abstract:
We present XIndex, which is a concurrent index library and designed for fast queries. It includes a concurrent ordered index (XIndex-R) and a concurrent hash index (XIndex-H). Similar to a recent proposal of the learned index, the indexes in XIndex use learned models to optimize index efficiency. Compared with the learned index, for the ordered index, XIndex-R is able to handle concurrent writes effectively and adapts its structure according to runtime workload characteristics. For the hash index, XIndex-H is able to avoid the resize operation blocking concurrent writes. Furthermore, the index
APA, Harvard, Vancouver, ISO, and other styles
3

Smelyakov, K. S., I. V. Kyryrchenko, G. Yu Tereshchenko, and D. P. Panasenko. "Using Machine Learning to Optimize Data Access in Hybrid Image Storage." Bionics of Intelligence 1, no. 99 (2023): 11–18. http://dx.doi.org/10.30837/bi.2023.1(99).02.

Full text
Abstract:
This work is dedicated to exploring the integration of machine learning to optimize data access in a hybrid image storage system. The primary task is to search for similar images among a large volume of visual data stored in the hybrid repository. A system has been developed that employs deep learning methods for feature extraction from images, specifically using the ResNet50 model, which provides high accuracy in feature extraction due to its deep architecture. For efficient image search, MongoDB was used for storing images and metadata, while ElasticSearch was utilized for fast indexing and
APA, Harvard, Vancouver, ISO, and other styles
4

Selihat, Maali, Belal Abuhaja, and Khalid Alkaabneh. "Secure audio file indexing based on hidden markov model (HMM) on the cloud storage." International Journal Artificial Intelligent and Informatics 2, no. 1 (2021): 1–8. http://dx.doi.org/10.33292/ijarlit.v2i1.30.

Full text
Abstract:
With the introduction of many social media applications and the exponential growth of the number of people using such applications to exchange Audio files as a main way of conveying confidential messages relaying on public telecommunications and networks. The need arise to secure audio data files and preserve the integrity of the message while traversing public networks and when the data is at rest in the cloud. Therefore, in this research, to ensure confidentiality and integrity of the audio files while reducing storage space several algorithms have been devised. To achieve this, we utilized
APA, Harvard, Vancouver, ISO, and other styles
5

Frady, E. Paxon, Denis Kleyko, and Friedrich T. Sommer. "A Theory of Sequence Indexing and Working Memory in Recurrent Neural Networks." Neural Computation 30, no. 6 (2018): 1449–513. http://dx.doi.org/10.1162/neco_a_01084.

Full text
Abstract:
To accommodate structured approaches of neural computation, we propose a class of recurrent neural networks for indexing and storing sequences of symbols or analog data vectors. These networks with randomized input weights and orthogonal recurrent weights implement coding principles previously described in vector symbolic architectures (VSA) and leverage properties of reservoir computing. In general, the storage in reservoir computing is lossy, and crosstalk noise limits the retrieval accuracy and information capacity. A novel theory to optimize memory performance in such networks is presented
APA, Harvard, Vancouver, ISO, and other styles
6

Abebe, Michael, Horatiu Lazu, and Khuzaima Daudjee. "Tiresias." Proceedings of the VLDB Endowment 15, no. 11 (2022): 3126–36. http://dx.doi.org/10.14778/3551793.3551857.

Full text
Abstract:
To efficiently store and query a DBMS, administrators must select storage and indexing configurations. For example, one must decide whether data should be stored in rows or columns, in-memory or on disk, and which columns to index. These choices can be challenging to make for workloads that are mixed requiring hybrid transactional and analytical processing (HTAP) support. There is growing interest in system designs that can adapt how data is stored and indexed to execute these workloads efficiently. We present Tiresias , a predictor that learns the cost of data accesses and predicts their late
APA, Harvard, Vancouver, ISO, and other styles
7

Rao, Sirisala Nageswara. "Optimized Cost Model for k-NN Queries in R*-Trees over Random Distribution." Advanced Materials Research 403-408 (November 2011): 3315–21. http://dx.doi.org/10.4028/www.scientific.net/amr.403-408.3315.

Full text
Abstract:
Efficient storage and retrieval of multidimensional data in large volumes has become one of the key issues in the design and implementation of commercial and application software. The kind of queries posted on such data is also multifarious. Nearest neighbor queries are one such category and have more significance in GIS type of application. R-tree and its sequel are data partitioned hierarchical multidimensional indexing structures that help in this purpose. Today’s research has turned towards the development of powerful analytical method to predict the performance of such indexing structures
APA, Harvard, Vancouver, ISO, and other styles
8

Ibtisam, Ferrahi Ibtisam, Sandro Bimonte, and Kamel Boukhalfa. "Logical and Physical Design of Spatial Non-Strict Hierarchies in Relational Spatial Data Warehouse." International Journal of Data Warehousing and Mining 15, no. 1 (2019): 1–18. http://dx.doi.org/10.4018/ijdwm.2019010101.

Full text
Abstract:
The emergence of spatial or geographic data in DW Systems defines new models that support the storage and manipulation of the data. The need to build an SDW and to optimize SOLAP queries continues to attract the interest of researchers in recent years. Several spatial data models have been investigated to extend classical multidimensional data models with spatial concepts. However, most of existing models do not handle a non-strict spatial hierarchy. Moreover, the complexity of the spatial data makes the execution time of spatial queries very considerable. Often, spatial indexation methods are
APA, Harvard, Vancouver, ISO, and other styles
9

Ma, Chaohong, Xiaohui Yu, Yifan Li, Xiaofeng Meng, and Aishan Maoliniyazi. "FILM." Proceedings of the VLDB Endowment 16, no. 3 (2022): 561–73. http://dx.doi.org/10.14778/3570690.3570704.

Full text
Abstract:
As modern applications generate data at an unprecedented speed and often require the querying/analysis of data spanning a large duration, it is crucial to develop indexing techniques that cater to larger-than-memory databases, where data reside on heterogeneous storage devices (such as memory and disk), and support fast data insertion and query processing. In this paper, we propose FILM, a F ully learned I ndex for L arger-than- M emory databases. FILM is a learned tree structure that uses simple approximation models to index data spanning different storage devices. Compared with existing tech
APA, Harvard, Vancouver, ISO, and other styles
10

Ge, Jiake, Huanchen Zhang, Boyu Shi, et al. "SALI: A Scalable Adaptive Learned Index Framework based on Probability Models." Proceedings of the ACM on Management of Data 1, no. 4 (2023): 1–25. http://dx.doi.org/10.1145/3626752.

Full text
Abstract:
The growth in data storage capacity and the increasing demands for high performance have created several challenges for concurrent indexing structures. One promising solution is the learned index, which uses a learning-based approach to fit the distribution of stored data and predictively locate target keys, significantly improving lookup performance. Despite their advantages, prevailing learned indexes exhibit constraints and encounter issues of scalability on multi-core data storage. This paper introduces SALI, the Scalable Adaptive Learned Index framework, which incorporates two strategies
APA, Harvard, Vancouver, ISO, and other styles
11

Romensky,, S. A., A. V. Nazarovskaya, and S. I. Rotkov. "DEVELOPMENT OF A DATABASE FOR STORING AND EXCHANGING GEOMETRIC INFORMATION." Vestnik komp'iuternykh i informatsionnykh tekhnologii, no. 234 (December 2023): 11–18. http://dx.doi.org/10.14489/vkit.2023.12.pp.011-018.

Full text
Abstract:
As a part of the work on the research and development of information technology for converting archival drawing, design and technological documentation into an electronic model of a product, there is often a need to create a data storage and management system, that will allow storing and processing simultaneously all types of geometric and graphic data present on the various stages of the product life cycle. The capabilities of traditional GGI storage methods have limitations, which makes it difficult to work with large volumes of data and complicates the process of accessing the necessary ele
APA, Harvard, Vancouver, ISO, and other styles
12

Boguslawski, P., P. Balak, and C. Gold. "DATABASE STORAGE AND TRANSPARENT MEMORY LOADING OF BIG SPATIAL DATASETS IMPLEMENTED WITH THE DUAL HALF-EDGE DATA STRUCTURE." International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLIII-B4-2022 (June 1, 2022): 9–15. http://dx.doi.org/10.5194/isprs-archives-xliii-b4-2022-9-2022.

Full text
Abstract:
Abstract. 3D spatial models covering big areas, such as cities, are widely developed in recent years. Loading of a whole model from a hard drive into a computer memory is often not possible due to big amount of data and memory size limitations. Optimisation techniques based on spatial indexing, such as tiling, are applied in order to load at least a part of a model as soon as possible, while the remaining parts are collected in the background. It is especially useful in visualisation of cities. A similar idea is proposed for a transparent loading of a model implemented with the dual half-edge
APA, Harvard, Vancouver, ISO, and other styles
13

Cheng, Yinyi, Kefa Zhou, Jinlin Wang, and Jining Yan. "Big Earth Observation Data Integration in Remote Sensing Based on a Distributed Spatial Framework." Remote Sensing 12, no. 6 (2020): 972. http://dx.doi.org/10.3390/rs12060972.

Full text
Abstract:
The arrival of the era of big data for Earth observation (EO) indicates that traditional data management models have been unable to meet the needs of remote sensing data in big data environments. With the launch of the first remote sensing satellite, the volume of remote sensing data has also been increasing, and traditional data storage methods have been unable to ensure the efficient management of large amounts of remote sensing data. Therefore, a professional remote sensing big data integration method is sorely needed. In recent years, the emergence of some new technical methods has provide
APA, Harvard, Vancouver, ISO, and other styles
14

Ramzan, Bajwa, Kazmi, and Amna. "Challenges in NoSQL-Based Distributed Data Storage: A Systematic Literature Review." Electronics 8, no. 5 (2019): 488. http://dx.doi.org/10.3390/electronics8050488.

Full text
Abstract:
Key-Value stores (KVSs) are the most flexible and simplest model of NoSQL databases, which have become highly popular over the last few years due to their salient features such as availability, portability, reliability, and low operational cost. From the perspective of software engineering, the chief obstacle for KVSs is to achieve software quality attributes (consistency, throughput, latency, security, performance, load balancing, and query processing) to ensure quality. The presented research is a Systematic Literature Review (SLR) to find the state-of-the-art research in the KVS domain, and
APA, Harvard, Vancouver, ISO, and other styles
15

Gnatyuk, Sergiy, Rat Berdibayev, Viktoriia Sydorenko, Oksana Zhyharevych, and Tetiana Smirnova. "SYSTEM FOR CYBER SECURITY EVENTS CORRELATION AND INCIDENT MANAGEMENT IN CRITICAL INFRASTRUCTURE OBJECTS." Cybersecurity: Education, Science, Technique 3, no. 19 (2023): 176–96. http://dx.doi.org/10.28925/2663-4023.2023.19.176196.

Full text
Abstract:
Modern information infrastructure consists of a large number of systems and components that require constant monitoring and control. To identify, analyze and eliminate possible cyber threats, it is recommended to use a single common solution - the so-called SIEM systems. SIEM technology collects event log data, detects unusual activity through real-time analysis, identifies threats, generates alerts, and suggests appropriate action scenarios. Today, the number and quality of SIEM systems has grown significantly, and the latest technologies of artificial intelligence, the Internet of Things, an
APA, Harvard, Vancouver, ISO, and other styles
16

Kumar, K., H. Ledoux, and J. Stoter. "COMPARATIVE ANALYSIS OF DATA STRUCTURES FOR STORING MASSIVE TINS IN A DBMS." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLI-B2 (June 7, 2016): 123–30. http://dx.doi.org/10.5194/isprs-archives-xli-b2-123-2016.

Full text
Abstract:
Point cloud data are an important source for 3D geoinformation. Modern day 3D data acquisition and processing techniques such as airborne laser scanning and multi-beam echosounding generate billions of 3D points for simply an area of few square kilometers. With the size of the point clouds exceeding the billion mark for even a small area, there is a need for their efficient storage and management. These point clouds are sometimes associated with attributes and constraints as well. Storing billions of 3D points is currently possible which is confirmed by the initial implementations in Oracle Sp
APA, Harvard, Vancouver, ISO, and other styles
17

Kumar, K., H. Ledoux, and J. Stoter. "COMPARATIVE ANALYSIS OF DATA STRUCTURES FOR STORING MASSIVE TINS IN A DBMS." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLI-B2 (June 7, 2016): 123–30. http://dx.doi.org/10.5194/isprsarchives-xli-b2-123-2016.

Full text
Abstract:
Point cloud data are an important source for 3D geoinformation. Modern day 3D data acquisition and processing techniques such as airborne laser scanning and multi-beam echosounding generate billions of 3D points for simply an area of few square kilometers. With the size of the point clouds exceeding the billion mark for even a small area, there is a need for their efficient storage and management. These point clouds are sometimes associated with attributes and constraints as well. Storing billions of 3D points is currently possible which is confirmed by the initial implementations in Oracle Sp
APA, Harvard, Vancouver, ISO, and other styles
18

Benito-Picazo, Jesús, Ezequiel López-Rubio, and Enrique Domínguez. "Growing Neural Forest-Based Color Quantization Applied to RGB Images." International Journal of Computer Vision and Image Processing 7, no. 3 (2017): 13–25. http://dx.doi.org/10.4018/ijcvip.2017070102.

Full text
Abstract:
Although last improvements in both physical storage technologies and image handling techniques have eased image managing processes, the large amount of information handled nowadays constantly demands more efficient ways to store and transmit image data streams. Among other alternatives for such purpose, the authors find color quantization, which consists of color indexing for minimal perceptual distortion image compression. In this context, artificial intelligence-based algorithms and more specifically, Artificial Neural Networks, have been consolidated as a powerful tool for unsupervised task
APA, Harvard, Vancouver, ISO, and other styles
19

Vrgoč, Domagoj, Carlos Rojas, Renzo Angles, et al. "MillenniumDB: An Open-Source Graph Database System." Data Intelligence 5, no. 3 (2023): 560–610. http://dx.doi.org/10.1162/dint_a_00229.

Full text
Abstract:
ABSTRACT In this systems paper, we present MillenniumDB: a novel graph database engine that is modular, persistent, and open source. MillenniumDB is based on a graph data model, which we call domain graphs, that provides a simple abstraction upon which a variety of popular graph models can be supported, thus providing a flexible data management engine for diverse types of knowledge graph. The engine itself is founded on a combination of tried and tested techniques from relational data management, state-of-the-art algorithms for worst-case-optimal joins, as well as graph-specific algorithms for
APA, Harvard, Vancouver, ISO, and other styles
20

Zhao, Hong, Wei-Jie Wang, Tao Wang, Zhao-Bin Chang, and Xiang-Yan Zeng. "Key-Frame Extraction Based on HSV Histogram and Adaptive Clustering." Mathematical Problems in Engineering 2019 (September 22, 2019): 1–10. http://dx.doi.org/10.1155/2019/5217961.

Full text
Abstract:
Along with the fast development of digital information technology and the application of Internet, video data begins to grow explosively. Some applications with high real-time requirements, such as object detection, require strong online video storage and analysis capabilities. Key-frame extraction is an important technique in video analysis, which provides an organizational framework for dealing with video content and reduces the amount of data required in video indexing. To address the problem, this study proposes a key-frame extraction method based on HSV (hue, saturation, value) histogram
APA, Harvard, Vancouver, ISO, and other styles
21

Zhu, Guicun, Meihui Hao, Changlong Zheng, and Linlin Wang. "Design of Knowledge Graph Retrieval System for Legal and Regulatory Framework of Multilevel Latent Semantic Indexing." Computational Intelligence and Neuroscience 2022 (July 19, 2022): 1–11. http://dx.doi.org/10.1155/2022/6781043.

Full text
Abstract:
Latent semantic analysis (LSA) is a natural language statistical model, which is considered as a method to acquire, generalize, and represent knowledge. Compared with other retrieval models based on concept dictionaries or concept networks, the retrieval model based on LSA has the advantages of strong computability and less human participation. LSA establishes a latent semantic space through truncated singular value decomposition. Words and documents in the latent semantic space are projected onto the dimension representing the latent concept, and then the semantic relationship between words c
APA, Harvard, Vancouver, ISO, and other styles
22

Pratap, Ajay. "Real Time Sales Forecasting." INTERNATIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT 09, no. 05 (2025): 1–9. https://doi.org/10.55041/ijsrem48883.

Full text
Abstract:
Abstract:. The project will offer a full sales and inventory management system in real time. It is backed by PostgreSQL and automated using a strong Python-based backend. The system is built to assist retailers in managing future sales trends in inventory and forecasts, offering a full data pipeline from prognosis and visualization work and preprocessing. PostgreSQL ensures scalable and reliable data storage and facilitates high-performance queries using optimization methods like indexing and query limiting. These optimizations are designed to offer real-time awareness of dashboards and report
APA, Harvard, Vancouver, ISO, and other styles
23

Sai, Kalyani Rachapalli. "Quantum Computing and Its Implications for Database Management." INTERNATIONAL JOURNAL OF INNOVATIVE RESEARCH AND CREATIVE TECHNOLOGY 11, no. 1 (2025): 1–8. https://doi.org/10.5281/zenodo.15349611.

Full text
Abstract:
Quantum computing, a paradigm shift from classical computing, offers unprecedented possibilities by taking advantage of quantum bits (qubits) and effects like superposition and entanglement. With the exponential increase in data, database management is becoming more and more complex, and quantum computing offers new paradigms for storage, retrieval, and query optimization. This paper examines the theoretical and practical intersections of quantum computing and database management systems (DBMS), considering possible enhancements in query execution times, indexing, cryptographic security, and t
APA, Harvard, Vancouver, ISO, and other styles
24

Ujang, Uznir, Francois Anton, Suhaibah Azri, Alias Abdul Rahman, and Darka Mioc. "3D Hilbert Space Filling Curves in 3D City Modeling for Faster Spatial Queries." International Journal of 3-D Information Modeling 3, no. 2 (2014): 1–18. http://dx.doi.org/10.4018/ij3dim.2014040101.

Full text
Abstract:
The advantages of three dimensional (3D) city models can be seen in various applications including photogrammetry, urban and regional planning, computer games, etc. They expand the visualization and analysis capabilities of Geographic Information Systems on cities, and they can be developed using web standards. However, these 3D city models consume much more storage compared to two dimensional (2 D) spatial data. They involve extra geometrical and topological information together with semantic data. Without a proper spatial data clustering method and its corresponding spatial data access metho
APA, Harvard, Vancouver, ISO, and other styles
25

Peng, Yang, Fangqiang Yu, Ming Zhang, Jinglin Xu, and Shang Gao. "Solutions on Establishing and Utilizing BIM for General Contractors in Key Scenarios of Digital Construction." Advances in Civil Engineering 2023 (July 27, 2023): 1–13. http://dx.doi.org/10.1155/2023/3951336.

Full text
Abstract:
Nowadays, digital construction has become popular when bringing convenience and efficiency to the traditional building construction industry. The primary tool of digital construction is the building information model (BIM). However, from the perspective of general contractors, unresolved puzzles still hinder obtaining the benefits of digital construction. When establishing a unified BIM from submodels provided by subcontractors, there will possibly be incomplete or inconsistent data during model merging. But extracting submodels from unified BIM often includes redundant data, thus making model
APA, Harvard, Vancouver, ISO, and other styles
26

Liu, Dandan, and Zhaonian Zou. "gCore: Exploring Cross-Layer Cohesiveness in Multi-Layer Graphs." Proceedings of the VLDB Endowment 16, no. 11 (2023): 3201–13. http://dx.doi.org/10.14778/3611479.3611519.

Full text
Abstract:
As multi-layer graphs can give a more accurate and reliable picture of the complex relationships between entities, cohesive subgraph mining, a fundamental task in graph analysis, has been studied on multi-layer graphs in the literature. However, existing cohesive subgraph models are designated for special multi-layer graphs such as multiplex networks and heterogeneous information networks. In this paper, we propose generalized core (gCore), a new notion of cohesive subgraph on general multi-layer graphs without any predefined constraints on the interconnections between vertices. The gCore mode
APA, Harvard, Vancouver, ISO, and other styles
27

Nieva, de la Hidalga Abraham, and Alex Hardisty. "Making Heterogeneous Specimen Data 'FAIR': Implementing a digital specimen repository." Biodiversity Information Science and Standards 3 (June 18, 2019): e37163. https://doi.org/10.3897/biss.3.37163.

Full text
Abstract:
The definition of a digital specimen is proposed to encompass the digital representation(s) of physical specimens from natural science collections. The digital specimen concept is intended to define a representation (digital object) that brings together an array of heterogeneous data types, which are themselves alternative physical specimen representations. In this case, the digital specimen (DS) holds references to specimen data from a collection management system, images, 3D models, research articles, DNA sequences, collector information, among many other data types. The proposal is to creat
APA, Harvard, Vancouver, ISO, and other styles
28

Akinola, Samuel. "Trends in Open Source RDBMS: Performance, Scalability and Security Insights." Journal of Research in Science and Engineering 6, no. 7 (2024): 22–28. http://dx.doi.org/10.53469/jrse.2024.06(07).05.

Full text
Abstract:
The landscape of open-source relational database management systems (RDBMS) is evolving rapidly, driven by the growing demand for scalable, secure, and high-performance data solutions. This paper investigates key trends in open-source RDBMS databases, aiming to contribute valuable insights to the database research community. A comprehensive literature review reveals current developments in performance optimization, scalability, security, and integration with emerging technologies. The research methodology involves a systematic analysis of prominent open-source RDBMS projects, including Postgre
APA, Harvard, Vancouver, ISO, and other styles
29

Snehal Eknath Phule. "Graph Theory Applications in Database Management." International Journal of Scientific Research in Modern Science and Technology 3, no. 3 (2024): 13–17. http://dx.doi.org/10.59828/ijsrmst.v3i3.190.

Full text
Abstract:
Graph theory, which is a branch of discrete mathematics, has emerged as a powerful tool in various domains, including database management. This abstract investigates the ways in which ideas and methods from graph theory which can be applied to database systems, offering a thorough synopsis of their benefits. Complex interactions within data can be well-modeled by using the basic concepts of graph theory, such as nodes, edges, and relationships. Because of its capacity to represent and query complex relationships, graph databases have become more and more popular in the field of database admini
APA, Harvard, Vancouver, ISO, and other styles
30

Nieva, de la Hidalga Abraham, Nicolas Cazenave, Donat Agosti, Zhengzhe Wu, Mathias Dillen, and Lars Nielsen. "Use of European Open Science Cloud and National e-Infrastructures for the Long-Term Storage of Digitised Assets from Natural History Collections." Biodiversity Information Science and Standards 3 (June 18, 2019): e37164. https://doi.org/10.3897/biss.3.37164.

Full text
Abstract:
Digitisation of Natural History Collections (NHC) has evolved from transcription of specimen catalogues in databases to web portals providing access to data, digital images, and 3D models of specimens. These portals increase global accessibility to specimens and help preserve the physical specimens by reducing their handling. The size of the NHC requires developing high-throughput digitisation workflows, as well as research into novel acquisition systems, image standardisation, curation, preservation, and publishing. Nowadays, herbarium sheet digitisation workflows (and fast digitisation stati
APA, Harvard, Vancouver, ISO, and other styles
31

Saukova, Y. N., and M. A. Hundzina. "Tensor Calculus in Digital Colorimetry." Devices and Methods of Measurements 13, no. 3 (2022): 216–27. http://dx.doi.org/10.21122/2220-9506-2022-13-3-216-227.

Full text
Abstract:
Any object can have many implementations in the form of digital images and any digital image can be processed many times increasing or decreasing accuracy and reliability. Digital colorimetry faces the need to work out issues of ensuring accuracy, metrological traceability and reliability. The purpose of this work was to generalize approaches to the description of multidimensional quantized spaces and show the possibilities of their adaptation to digital colorimetry. This approach will minimize the private and global risks in measurements.For color identification digital colorimetry uses stand
APA, Harvard, Vancouver, ISO, and other styles
32

Cao, Zhixuan, Abani Patra, Marcus Bursik, E. Bruce Pitman, and Matthew Jones. "Plume-SPH 1.0: a three-dimensional, dusty-gas volcanic plume model based on smoothed particle hydrodynamics." Geoscientific Model Development 11, no. 7 (2018): 2691–715. http://dx.doi.org/10.5194/gmd-11-2691-2018.

Full text
Abstract:
Abstract. Plume-SPH provides the first particle-based simulation of volcanic plumes. Smoothed particle hydrodynamics (SPH) has several advantages over currently used mesh-based methods in modeling of multiphase free boundary flows like volcanic plumes. This tool will provide more accurate eruption source terms to users of volcanic ash transport and dispersion models (VATDs), greatly improving volcanic ash forecasts. The accuracy of these terms is crucial for forecasts from VATDs, and the 3-D SPH model presented here will provide better numerical accuracy. As an initial effort to exploit the fe
APA, Harvard, Vancouver, ISO, and other styles
33

Iliopoulos, Costas. "Storage and indexing of massive data." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 372, no. 2016 (2014): 20130213. http://dx.doi.org/10.1098/rsta.2013.0213.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Yang, Yuqi, Xiaoqing Zuo, Kang Zhao, and Yongfa Li. "Integrating NoSQL, Hilbert Curve, and R*-Tree to Efficiently Manage Mobile LiDAR Point Cloud Data." ISPRS International Journal of Geo-Information 13, no. 7 (2024): 253. http://dx.doi.org/10.3390/ijgi13070253.

Full text
Abstract:
The widespread use of Light Detection and Ranging (LiDAR) technology has led to a surge in three-dimensional point cloud data; although, it also poses challenges in terms of data storage and indexing. Efficient storage and management of LiDAR data are prerequisites for data processing and analysis for various LiDAR-based scientific applications. Traditional relational database management systems and centralized file storage struggle to meet the storage, scaling, and specific query requirements of massive point cloud data. However, NoSQL databases, known for their scalability, speed, and cost-e
APA, Harvard, Vancouver, ISO, and other styles
35

Vimal, Vrince. "An Efficient and Secure Query Processing and Indexing model for Secure Dynamic Cloud Storage." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 10, no. 2 (2019): 1043–48. http://dx.doi.org/10.17762/turcomat.v10i2.13623.

Full text
Abstract:
To ensure the security and privacy of stored data, as well as the efficacy and efficiency of cloud storage, it is necessary to overcome significant challenges, such as efficient and secure query processing and indexing in dynamic cloud storage. There are a number of limitations with the present methodologies and tactics for query processing and indexing in cloud storage, including high processing overhead, scalability problems, and security concerns. In this paper, we provide a method for efficiently and securely executing queries and indexing data in dynamic cloud storage. The suggested syste
APA, Harvard, Vancouver, ISO, and other styles
36

Moses, Timothy, Abubakar Usman Othman, Umar Yahaya Aisha, Abdulsalam Ya’u Gital, Boukari Souley, and Badmos Tajudeen Adeleke. "Big data indexing: Taxonomy, performance evaluation, challenges and research opportunities." Journal of Computer Science and Engineering (JCSE) 3, no. 2 (2022): 71–94. http://dx.doi.org/10.36596/jcse.v3i2.548.

Full text
Abstract:
In order to efficiently retrieve information from highly huge and complicated datasets with dispersed storage in cloud computing, indexing methods are continually used on big data. Big data has grown quickly due to the accessibility of internet connection, mobile devices like smartphones and tablets, body-sensor devices, and cloud applications. Big data indexing has a variety of problems as a result of the expansion of big data, which is seen in the healthcare industry, manufacturing, sciences, commerce, social networks, and agriculture. Due to their high storage and processing requirements, c
APA, Harvard, Vancouver, ISO, and other styles
37

Du, M., J. Wang, C. Jing, J. Jiang, and Q. Chen. "HIERARCHICAL DATA MODEL FOR STORAGE AND INDEXING OF MASSIVE STREET VIEW." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLII-2/W13 (June 5, 2019): 1295–99. http://dx.doi.org/10.5194/isprs-archives-xlii-2-w13-1295-2019.

Full text
Abstract:
<p><strong>Abstract.</strong> Maintaining an up-to-date inventory of urban infrastructure such as fire hydrant is critical to urban management. Street view database such as Google Street View and Baidu Street View contain street-level images, their potential for urban management has not been fully explored. For the massive image, data model for storage and indexing is an important research issue. Considering multiple cameras and GPS device in the image capturing platform, a hierarchical data model named 3D-Grid is proposed. Massive street view images were stored according to
APA, Harvard, Vancouver, ISO, and other styles
38

Adeleke, Imran A., Adegbuyi D. Gbadebo, and Abayomi O. Dawodu. "A B+-Tree-Based Indexing and Storage of Numerical Records in School Databases." Asian Journal of Research in Computer Science 16, no. 4 (2023): 418–27. http://dx.doi.org/10.9734/ajrcos/2023/v16i4401.

Full text
Abstract:
The need for effective indexing and retrieval of data is paramount in any contemporary organization. However, the use of tree data structure had been effective in this regard as evident in literature. This article gives an overview of B+-tree data structure, its indexing technique and application in indexing and retrieving students’ academic records in the school system in order to make such records flexible. The study demonstrates the indexing and arrangement patterns of some numerical data. In essence, it discusses how to adopt the use of B+-tree data structure to manage some numerical data
APA, Harvard, Vancouver, ISO, and other styles
39

Chen, S., Z. Wang, L. Bai, et al. "LARGE VECTOR SPATIAL DATA STORAGE AND QUERY PROCESSING USING CLICKHOUSE." International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLVIII-M-1-2023 (April 21, 2023): 65–72. http://dx.doi.org/10.5194/isprs-archives-xlviii-m-1-2023-65-2023.

Full text
Abstract:
Abstract. The exponential growth of geospatial data resulting from the development of earth observation technology has created significant challenges for traditional relational databases. While NoSQL databases based on distributed file systems can handle massive data storage, they often struggle to cope with real-time query. Column-storage databases, on other hand, are highly effective at both storage and query processing for large-scale datasets. In this paper, we propose a spatial version of ClickHouse that leverages R-Tree indexing to enable efficient storage and real-time analysis of massi
APA, Harvard, Vancouver, ISO, and other styles
40

Jiang, Chao, Jinlin Wang, and Yang Li. "An Efficient Indexing Scheme for Network Traffic Collection and Retrieval System." Electronics 10, no. 2 (2021): 191. http://dx.doi.org/10.3390/electronics10020191.

Full text
Abstract:
Historical network traffic retrieval, both at the packet and flow level, has been applied in many fields of network security, such as network traffic analysis and network forensics. To retrieve specific packets from a vast number of packet traces, it is an effective solution to build indexes for the query attributes. However, it brings challenges of storage consumption and construction time overhead for packet indexing. To address these challenges, we propose an efficient indexing scheme called IndexWM based on the wavelet matrix data structure for packet indexing. Moreover, we design a packet
APA, Harvard, Vancouver, ISO, and other styles
41

Geetha, K., and A. Vijaya. "Cross-Layer Fragment Indexing based File Deduplication using Hyper Spectral Hash Duplicate Filter (HSHDF) for Optimized Cloud Storage." International Journal on Recent and Innovation Trends in Computing and Communication 11, no. 8s (2023): 565–75. http://dx.doi.org/10.17762/ijritcc.v11i8s.7239.

Full text
Abstract:
Cloud computing and storage processing is a big service for maintaining a large number of data in a centralized server to store and retrieve data depending on the use to pay as a service model. Due to increasing storage depending on duplicate copy presence during different sceneries, the increased size leads to increased cost. To resolve this problem, we propose a Cross-Layer Fragment Indexing (CLFI) based file deduplication using Hyper Spectral Hash Duplicate Filter (HSHDF) for optimized cloud storage. Initially, the file storage indexing easy carried out with Lexical Syntactic Parser (LSP) t
APA, Harvard, Vancouver, ISO, and other styles
42

Tulkinbekov, Khikmatullo, and Deok-Hwan Kim. "Data Modifications in Blockchain Architecture for Big-Data Processing." Sensors 23, no. 21 (2023): 8762. http://dx.doi.org/10.3390/s23218762.

Full text
Abstract:
Due to the immutability of blockchain, the integration with big-data systems creates limitations on redundancy, scalability, cost, and latency. Additionally, large amounts of invaluable data result in the waste of energy and storage resources. As a result, the demand for data deletion possibilities in blockchain has risen over the last decade. Although several prior studies have introduced methods to address data modification features in blockchain, most of the proposed systems need shorter deletion delays and security requirements. This study proposes a novel blockchain architecture called Un
APA, Harvard, Vancouver, ISO, and other styles
43

Wang, Sheng, David Maier, and Beng Chin Ooi. "Lightweight indexing of observational data in log-structured storage." Proceedings of the VLDB Endowment 7, no. 7 (2014): 529–40. http://dx.doi.org/10.14778/2732286.2732290.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Li, Junjie, and Chong Fan. "Distributed-Based Storage and Indexing of Marine Environmental Data." Journal of Physics: Conference Series 3007, no. 1 (2025): 012028. https://doi.org/10.1088/1742-6596/3007/1/012028.

Full text
Abstract:
Abstract For the rapid growth of marine environmental data with spatial and temporal characteristics, traditional relational databases have certain limitations in storing and querying massive marine environmental data, while non-relational databases have difficulty indexing massive marine environmental data efficiently, and the management of massive marine data is facing new challenges. In this paper, a distributed marine environmental data storage scheme based on HBase is designed and implemented. Firstly, an efficient RowKey is designed for the marine environmental data structure, and then Z
APA, Harvard, Vancouver, ISO, and other styles
45

Singhal, Shubhanshi, Akanksha Kaushik, and Pooja Sharma. "A Novel approach of data deduplication for distributed storage." International Journal of Engineering & Technology 7, no. 2.4 (2018): 46. http://dx.doi.org/10.14419/ijet.v7i2.4.10040.

Full text
Abstract:
Due to drastic growth of digital data, data deduplication has become a standard component of modern backup systems. It reduces data redundancy, saves storage space, and simplifies the management of data chunks. This process is performed in three steps: chunking, fingerprinting, and indexing of fingerprints. In chunking, data files are divided into the chunks and the chunk boundary is decided by the value of the divisor. For each chunk, a unique identifying value is computed using a hash signature (i.e. MD-5, SHA-1, SHA-256), known as fingerprint. At last, these fingerprints are stored in the i
APA, Harvard, Vancouver, ISO, and other styles
46

Ankita Sappa. "Neural Network Powered Indexing Techniques for High Performance Data Retrieval." Research Briefs on Information and Communication Technology Evolution 11 (March 11, 2025): 22–41. https://doi.org/10.69978/rebicte.v11i.210.

Full text
Abstract:
Modern applications’ data growth poses the limitation of requiring highly effective and flexible indexing methods. Structures such as B-tree, hash index, and spatial tree are considered the oldest forms of indexing, but they seem to fail when it comes to high and constantly changing dimensional structures. The objective of this paper is to increase the speed, precision, and scope of data retrieval enhancement using the indexing methods powered by neural networks. We teach neural networks that cleverly change the key space to storage space as a mapping function to minimize query time and enhanc
APA, Harvard, Vancouver, ISO, and other styles
47

Kouahla, Zineddine, Ala-Eddine Benrazek, Mohamed Amine Ferrag, et al. "A Survey on Big IoT Data Indexing: Potential Solutions, Recent Advancements, and Open Issues." Future Internet 14, no. 1 (2021): 19. http://dx.doi.org/10.3390/fi14010019.

Full text
Abstract:
The past decade has been characterized by the growing volumes of data due to the widespread use of the Internet of Things (IoT) applications, which introduced many challenges for efficient data storage and management. Thus, the efficient indexing and searching of large data collections is a very topical and urgent issue. Such solutions can provide users with valuable information about IoT data. However, efficient retrieval and management of such information in terms of index size and search time require optimization of indexing schemes which is rather difficult to implement. The purpose of thi
APA, Harvard, Vancouver, ISO, and other styles
48

Li, Wu, Wu, and Zhao. "An Adaptive Construction Method of Hierarchical Spatio-Temporal Index for Vector Data under Peer-to-Peer Networks." ISPRS International Journal of Geo-Information 8, no. 11 (2019): 512. http://dx.doi.org/10.3390/ijgi8110512.

Full text
Abstract:
Spatio-temporal indexing is a key technique in spatio-temporal data storage and management. Indexing methods based on spatial filling curves are popular in research on the spatio-temporal indexing of vector data in the Not Relational (NoSQL) database. However, the existing methods mostly focus on spatial indexing, which makes it difficult to balance the efficiencies of time and space queries. In addition, for non-point elements (line and polygon elements), it remains difficult to determine the optimal index level. To address these issues, this paper proposes an adaptive construction method of
APA, Harvard, Vancouver, ISO, and other styles
49

Guan, Runda, Ziyu Wang, Xiaokang Pan, Rongjie Zhu, Biao Song, and Xinchang Zhang. "SbMBR Tree—A Spatiotemporal Data Indexing and Compression Algorithm for Data Analysis and Mining." Applied Sciences 13, no. 19 (2023): 10562. http://dx.doi.org/10.3390/app131910562.

Full text
Abstract:
In the field of data analysis and mining, adopting efficient data indexing and compression techniques to spatiotemporal data can significantly reduce computational and storage overhead for the abilities to control the volume of data and exploit the spatiotemporal characteristics. However, traditional lossy compression techniques are hardly suitable due to their inherently random nature. They often impose unpredictable damage to scientific data, which affects the results of data mining and analysis tasks that require certain precision. In this paper, we propose a similarity-based minimum boundi
APA, Harvard, Vancouver, ISO, and other styles
50

YAO, Qiu-Lin, Ying WANG, Ping LIU, and Li GUO. "Storage Optimized Containment-Encoded Intervals Indexing for Data Stream Querying." Journal of Software 20, no. 9 (2009): 2462–69. http://dx.doi.org/10.3724/sp.j.1001.2009.03402.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!