Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Computer Engineering
Preprocessing Of Astronomical Images From The Neowise Survey For Near-Earth Asteroid Detection, Rachel Meyer
Preprocessing Of Astronomical Images From The Neowise Survey For Near-Earth Asteroid Detection, Rachel Meyer
Scholar Week 2016 - present
Asteroid detection is a common field in astronomy for planetary defense which requires observations from survey telescopes to detect and classify different objects. The amount of data collected each night is increasing as better designed telescopes are created each year. This amount is quickly becoming unmanageable and many researchers are looking for ways to better process this data. The dominant solution is to implement computer algorithms to automatically detect these sources and to use Machine Learning in order to create a more efficient and accurate classifier. In the past there has been a focus on larger asteroids that create streaks …
Performance Analysis Of Java Persistence Api Providers, Besart Pllana
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
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 …