Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Processing (3)
- Application (2)
- Optimization (2)
- Chinese Remainder Theorem (1)
- Collaborations (1)
-
- Concurrent (1)
- Constrained (1)
- Content (1)
- Content-based retrieval (1)
- Data (1)
- Data mining (1)
- Data models (1)
- Delta (1)
- Digital (1)
- Distributed (1)
- Extract (1)
- Hierarchical Encryption (1)
- Identify (1)
- Implementation (1)
- Information (1)
- Isolation (1)
- Limited (1)
- Long (1)
- Materialized (1)
- Model (1)
- Partitioning (1)
- Personal (1)
- Privacy (1)
- Protect (1)
- Protocol (1)
- File Type
Articles 1 - 13 of 13
Full-Text Articles in Physical Sciences and Mathematics
Application Of Semistructured Data Model To The Implementation Of Semantic Content-Based Video Retrieval System, Lilac A. E. Al-Safadi, Janusz R. Getta
Application Of Semistructured Data Model To The Implementation Of Semantic Content-Based Video Retrieval System, Lilac A. E. Al-Safadi, Janusz R. Getta
Dr Janusz Getta
Semantic indexing of a video document is a process that performs the identification of elementary and complex semantic units in the indexed document in order to create a semantic index defined as a mapping of semantic units into the sequences of video frames. Semantic content-based video retrieval system is a software system that uses a semantic index built over a collection of video documents to retrieve the sequences of video frames that satisfy the given conditions. This work introduces a new multilevel view of data for the semantic content-based video retrieval systems. At the topmost level, we define an abstract …
Semantic Modeling For Video Content-Based Retrieval Systems, L. Al Safadi, J. Getta
Semantic Modeling For Video Content-Based Retrieval Systems, L. Al Safadi, J. Getta
Dr Janusz Getta
This work proposes a semantic data model for video documents based on the story-line structure powerful enough to express various human interpretations of video documents, and introduces a formal query language for video retrieval that facilitates retrieval of users' heterogeneous queries based on the proposed model. The paper identifies the elementary semantic units, composite semantic units, associations and abstraction mechanisms necessary for symbolic modeling of semantic video contents. The method is independent of presentation media and it has its origins in symbolic modeling systems developed for database and complex software systems design.
Identify And Extract Delta Of Materialized View With Limited Collaborations, Z. Lu, Janusz Getta
Identify And Extract Delta Of Materialized View With Limited Collaborations, Z. Lu, Janusz Getta
Dr Janusz Getta
This work considers the materialized view maintenance in a distributed environment where the collaboration of the operational systems is limited to granting read only access on the selected relational tables. In addition, due to possibly large volumes of source relational tables involved in the view maintenance process and consequently enormous overhead associated with data extracting and transporting, the efficiency issues have been taken into the consideration and some optimization techniques are included in this paper.
Using Digital Tickets To Protect Personal Privacy, Yibing Kong, Jennifer Seberry, Janusz Getta, Ping Yu
Using Digital Tickets To Protect Personal Privacy, Yibing Kong, Jennifer Seberry, Janusz Getta, Ping Yu
Dr Janusz Getta
No abstract provided.
Living With Inconsistencies In A Multidatabase System, J. R. Getta
Living With Inconsistencies In A Multidatabase System, J. R. Getta
Dr Janusz Getta
Integration of autonomous sources of information is one of the most important problems in implementation of the global information systems. This paper considers multidatabase systems as one of the typical architectures of global information services and addresses a problem of storing and processing inconsistent information in such systems. A new data model proposed in the paper separates sure from inconsistent information and introduces a system of elementary operations on the containers with sure and inconsistent information. A review of the implementation aspects in an environment of a typical relational database management system concludes the paper.
A Cryptographic Solution For General Access Control, Y. Kong, Jennifer Seberry, J. Getta, Ping Yu
A Cryptographic Solution For General Access Control, Y. Kong, Jennifer Seberry, J. Getta, Ping Yu
Dr Janusz Getta
As one of the most popular information safeguarding mechanisms, access control is widely deployed in information systems. However, access control approach suffers from a tough problem, i.e. system administrators must be unconditionally trusted. Cryptographic substitutes have been developed to solve the above problem. In particular, hierarchical encryption, as an alternate solution of access control in a hierarchy, has been intensively studied. In this paper, we propose a cryptographic solution for general access control based on Chinese Remainder Theorem. Our solution has two categories: data based solution and key based solution. In contrast to the most recent hierarchical encryption system: Ray, …
Application Of Snapshot Isolation Protocol To Concurrent Processing Of Long Transactions, Yang Yang, Janusz R. Getta
Application Of Snapshot Isolation Protocol To Concurrent Processing Of Long Transactions, Yang Yang, Janusz R. Getta
Dr Janusz Getta
Snapshot Isolation (SI) protocol is a database transaction processing algorithm used by some of commercial database systems to manage the concurrent executions of database transactions. SI protocol is a special case of multi-version algorithm. It avoids many of the anomalies typical for the concurrent processing of database transactions. Unfortunately, SI protocol does not guarantee correct serialization of database transactions under certain conditions. A recent work [3] proposed a formal solution, which characterizes the correctness of transactions running under SI protocoL However, the protocol is inefficient when it comes to processing long transactions. In this paper, we show that the limitations …
Query Scrambling In Distributed Multidatabase Systems, J. R. Getta
Query Scrambling In Distributed Multidatabase Systems, J. R. Getta
Dr Janusz Getta
This work addresses the problem of efficient query processing in multidatabase systems distributed over wide-area networks. The solution unifies the query scrambling and reduction approaches to dynamic optimization of query processing plans at the data integration stage. The paper presents a new data integration algorithm based on query scrambling and the extended reduction technique. The algorithm both reschedules data integration operations and reductions of arguments and permits the concurrent computations of operations and reductions.
On Adaptive And Online Data Integration, J. R. Getta
On Adaptive And Online Data Integration, J. R. Getta
Dr Janusz Getta
The recent works on integration of large database systems distributed over wide-area networks concentrate on the adaptive and online techniques. Online property of data integration means continuous integration of transmitted data with the already available results. Adaptivity materializes in a form of dynamic adjustments to the data integration plans in a response to the recent characteristics of data transmission. Implementation of adaptive and online data integration needs the specialized systems of operations and transformations of integration plans. This paper describes a new class of elementary operations on increments and/or decrements of data and shows how to express data integration plans …
Optimization Of Task Processing Schedules In Distributed Information Systems, Janusz R. Getta
Optimization Of Task Processing Schedules In Distributed Information Systems, Janusz R. Getta
Dr Janusz Getta
The performance of data processing in distributed information systems strongly depends on theefficient scheduling of the applications that access data at the remote sites. This work assumes atypical model of distributed information system where a central site is connected to a number ofremote and highly autonomous remote sites. An application started by a user at a central site isdecomposed into several data processing tasks to be independently processed at the remote sites.The objective of this work is to find a method for optimization of task processing schedules at acentral site. We define an abstract model of data and a system …
A Parameterised Algorithm For Mining Association Rules, N. Denwattana, J. Getta
A Parameterised Algorithm For Mining Association Rules, N. Denwattana, J. Getta
Dr Janusz Getta
A central part of many algorithms for mining association rules in large data sets is a procedure that finds so called frequent itemsets. This paper proposes a new approach to finding frequent itemsets. The approach reduces a number of passes through an input data set and generalises a number of strategies proposed so far. The idea is to analyse a variable number n of itemset lattice levels in p scans through an input data set. It is shown that for certain values of parameters (n,p) this method provides more flexible utilisation of fast access transient memory and faster elimination of …
Optimization Of Online Data Integration, J. R. Getta
Optimization Of Online Data Integration, J. R. Getta
Dr Janusz Getta
Online data integration is a process of continuous consolidation of data transmitted over the wide area networks with data already stored at a central site of a multidatabase system. The continuity of the process requires activation of data integration procedure each time a new portion of data is received at a central site. Efficient implementation of online data integration needs a new system of elementary operations on the increments and/or decrements of data and the intermediate results of integration. This work shows how to derive a new system of elementary operations for online data integration from a system of base …
Optimization Of Query Processing Through Constrained Vertical Partitioning Of Relational Tables, Zhenjie Liu, Janusz R. Getta
Optimization Of Query Processing Through Constrained Vertical Partitioning Of Relational Tables, Zhenjie Liu, Janusz R. Getta
Dr Janusz Getta
Vertical partitioning is an effective way of improving performance in the database systems where a significant percentage of query processing time is spent on the full scans of relational tables. Vertical partitioning provides even more compelling performance gains when it is combined with the controlled replication of data in the environments where the processing of queries dominates the data manipulations. This paper proposes a new algorithm that finds a suboptimal vertical partitioning of relational tables under a constraint that certain level of redundancies is acceptable in a database. TIle algorithm is based on a new cost model, which precisely estimates …