Searching through Embedded Databases

THE DAY OF THE standalone database may be numbered. Database searching is now embedded in the latest version of Microsoft Office software, so the process of looking for information is interwoven into writing a report or creating a presentation. Some corporate librarians wonder how this will affect their role

Evaluación del rendimiento de bases de datos embebida: un estudio empírico

Introduction: With the rapid deployment of embedded databases across a wide range of embedded devices such as mobile devices, Internet of Things (IoT) devices, etc., the amount of data generated by such devices is also growing increasingly. For this reason, the performance is considered as a crucial criterion in the process of selecting the most suitable embedded database management system to be used to store/retrieve data of these devices. Currently, many embedded databases are available to be utilized in this context. Materials and Methods: In this paper, four popular open-source relational embedded databases; namely, H2, HSQLDB, Apache Derby, and SQLite have been compared experimentally with each other to evaluate their operational performance in terms of creating database tables, retrieving data, inserting data, updating data, deleting data. Results and Discussion: The experimental results of this paper have been illustrated in Table 4. Conclusions: The experimental results and analysis showed that HSQLDB outperformed other databases in most evaluation scenarios

A comparison of forensic evidence recovery techniques for a windows mobile smart phone

<p>Acquisition, decoding and presentation of information from mobile devices is complex and challenging. Device memory is usually integrated into the device, making isolation prior to recovery difficult. In addition, manufacturers have adopted a variety of file systems and formats complicating decoding and presentation.</p> <p>A variety of tools and methods have been developed (both commercially and in the open source community) to assist mobile forensics investigators. However, it is unclear to what extent these tools can present a complete view of the information held on a mobile device, or the extent the results produced by different tools are consistent.</p> <p>This paper investigates what information held on a Windows Mobile smart phone can be recovered using several different approaches to acquisition and decoding. The paper demonstrates that no one technique recovers all information of potential forensic interest from a Windows Mobile device; and that in some cases the information recovered is conflicting.</p&gt

Performance Comparison of the Filesystem and Embedded Key-Value Databases

A common scenario when developing local applications is storing many records and then retrieving them by ID. A developer can simply save the records as files or use an embedded database. Large numbers of files can slow down filesystems, but developers may want to avoid a dependency on an embedded database if it offers little benefit for their use case. We will compare the performance for the insert, update, get and delete operations and the space efficiency of storing records as files vs. using key-value embedded databases including RocksDB, LevelDB, Berkley DB, and SQLite

О топологии путей нормализации в реляционном каркасе

Исследованы пути нормализации в универсальном каркасе реляционных баз данных (БД) и топологии этих путей. Доказана теорема замкнутости путей нормализации в реляционном каркасе. Теорема позволяет применять реляционный каркас как уникальный носитель схем БД, нормализованных до высоких форм, а также анализировать существующие и внедренные БД на предмет их аномалий и влияния на приложения в процессе эксплуатации.Досліджено шляхи нормалізації в універсальному каркасі реляційних баз даних (БД) і топологію цих шляхів. Доведено теорему замкненості шляхів нормалізації в реляційному каркасі. Теорема дозволяє використовувати реляційний каркас в якості універсального носія схем БД, нормалізованих до високих форм, а також аналізувати існуючі та впроваджені БД на предмет їх аномалій та впливу на програмне застосування в процесі експлуатації.In the normalization ways in the universal frame of the relational databases and the topology of these ways are investigated. Theorem about closure of normalization ways in a relational frame has been proved. The theorem allows using a relational frame as a unique database schemes carrier, normalized to the higher forms. It also allows analyzing the existing and embedded databases for their anomalies and the impact on the software usage during the operation

Supporting Read/Write Applications in Embedded Real-time Systems via Suspension-aware Analysis

In many embedded real-time systems, applications often interact with I/O devices via read/write operations, which may incur considerable suspension delays. Unfortunately, prior analysis methods for validating timing correctness in embedded systems become quite pessimistic when suspension delays are present. In this paper, we consider the problem of supporting two common types of I/O applications in a multiprocessor system, that is, write-only applications and read-write applications. For the write-only application model, we present a much improved analysis technique that results in only O(m) suspension-related utilization loss, where m is the number of processors. For the second application model, we present a flexible I/O placement strategy and a corresponding new scheduling algorithm, which can completely circumvent the negative impact due to read- and write-induced suspension delays. We illustrate the feasibility of the proposed I/O-placement-based schedule via a case study implementation. Furthermore, experiments presented herein show that the improvement with respect to system utilization over prior methods is often significant

Parallel Deferred Update Replication

Deferred update replication (DUR) is an established approach to implementing highly efficient and available storage. While the throughput of read-only transactions scales linearly with the number of deployed replicas in DUR, the throughput of update transactions experiences limited improvements as replicas are added. This paper presents Parallel Deferred Update Replication (P-DUR), a variation of classical DUR that scales both read-only and update transactions with the number of cores available in a replica. In addition to introducing the new approach, we describe its full implementation and compare its performance to classical DUR and to Berkeley DB, a well-known standalone database