A method is presented to filter the output of a word recognition algorithm, which may contain errors, to locate decisions that should be correct with a high degree of certainty. The algorithm uses the output of a word recognition system and techniques used in information retrieval to characterize a free-text document database to locate a set of documents that have topics which are similar to th...

An OCR free word spotting method is developed and evaluated under a strong experimental protocol. Different feature sets are evaluated under the same experimental conditions. In addition, a tuning process in the document segmentation step is proposed which provides a significant reduction in terms of processing time. For this purpose, a complete OCRfree method for word spotting in printed docum...

In nowadays applications, the amount of data in the database grows exponentially. So, the DBMS must process these huge amounts of data as fast as possible. The main aim of this study is to prove that NoSQL databases process big data faster than relational database. The changing in applications, user and infrastructure characteristics, mostly of the Web 2.0 domain and cloud platform, led to expl...

The competent software architecture plays a crucial role in the difficult task of big data processing for SQL and NoSQL databases. databases were created to organize allow horizontal expansion. databases, on other hand, support scalability can efficiently process large amounts unstructured data. Organizational needs determine which paradigm is appropriate, yet selecting best option not always e...

In this paper, we describe the development of an archiving system according to the BERKOM teleservice ‘‘Multimedia Archiving” defined recently. This teleservice is utilized for storage and retrieval of multimedia documents. It can be exploited in applications that require document pools, information services, and workflow management. As a basis of our system we use the ISO/IEC standard ‘‘Docume...

With rapidly decreasing storage costs, temporal document databases are now a viable solution in many contexts. However, storing an ever-growing database can still be too costly, and as a consequence it is desirable to be able to physically delete old versions of data. Traditionally, this has been performed by an operation called vacuuming, where the oldest versions are physically deleted or mig...

A key observation is that the invariants in database management determine the mapping steps of the supporting architecture. Referring to the multi-layered architecture of record-oriented database management systems (DBMSs), we sketch the advances made during the past decades. Then, we explore the ways how this proven architecture can be used to implement XML DBMSs (XDBMSs). Major changes and ad...

dDedup is a similarity-based deduplication scheme for on-line database management systems (DBMSs). Beyond block-level compression of individual database pages or operation log (oplog) messages, as used in today’s DBMSs, dDedup uses byte-level delta encoding of individual records within the database to achieve greater savings. dDedup’s single-pass encoding method can be integrated into the stora...