Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 4 of 4

Full-Text Articles in Computer Engineering

Performance Analysis Of Java Persistence Api Providers, Besart Pllana Oct 2018

Performance Analysis Of Java Persistence Api Providers, Besart Pllana

UBT International Conference

Nowadays, fast and accurate access to data is very important. Usually data is managed and processed through software applications. In recent years, the most preferred programming model by most application developers is Object Oriented Programming (OOP) where data is represented through objects. These data must be persistent and therefore needs to be stored, and storage can be done on a variety of databases. The most common databases are Relational Database Management Systems (RDBMS). While persistence of objects in RDBMS is limited by object-relational mismatch which is the inconsistency of the direct interaction between two components based on different approaches, OOP ...


Sort Vs. Hash Join On Knights Landing Architecture, Victor L. Pan, Felix Lin Aug 2018

Sort Vs. Hash Join On Knights Landing Architecture, Victor L. Pan, Felix Lin

The Summer Undergraduate Research Fellowship (SURF) Symposium

With the increasing amount of information stored, there is a need for efficient database algorithms. One of the most important database operations is “join”. This involves combining columns from two tables and grouping common values in the same row in order to minimize redundant data. The two main algorithms used are hash join and sort merge join. Hash join builds a hash table to allow for faster searching. Sort merge join first sorts the two tables to make it more efficient when comparing values. There has been a lot of debate over which approach is superior. At first, hash join ...


Querying And Visualization Of Moving Objects Using Constraint Databases, Semere M. Woldemariam Jul 2017

Querying And Visualization Of Moving Objects Using Constraint Databases, Semere M. Woldemariam

Computer Science and Engineering: Theses, Dissertations, and Student Research

Good querying and visualization of moving objects and their trajectories is still an open problem. This thesis investigates three types of moving objects. First, projectiles, whose parabolic motion is difficult to represent. Second, moving objects that slide down a slope. The representation of these objects is challenging because of their accelerating motion. Third, the motion of migrating animals. The motion of migrating animals is challenging because it also involves some spatio-temporal interpolation. The thesis shows a solution to these problems using ideas from physics and an implementation in the MLPQ constraint databases system. The MLPQ implementation enables several complex spatio-temporal ...


Data Mining Of Protein Databases, Christopher Assi Jul 2012

Data Mining Of Protein Databases, Christopher Assi

Computer Science and Engineering: Theses, Dissertations, and Student Research

Data mining of protein databases poses special challenges because many protein databases are non-relational whereas most data mining and machine learning algorithms assume the input data to be a relational database. Protein databases are non-relational mainly because they often contain set data types. We developed new data mining algorithms that can restructure non-relational protein databases so that they become relational and amenable for various data mining and machine learning tools. We applied the new restructuring algorithms to a pancreatic protein database. After the restructuring, we also applied two classification methods, such as decision tree and SVM classifiers and compared their ...