Open Access. Powered by Scholars. Published by Universities.®
Databases and Information Systems Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Publication
- Publication Type
Articles 1 - 2 of 2
Full-Text Articles in Databases and Information Systems
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 …
Comparison Of Clustered Rdf Data Stores, Venkata Patchigolla
Comparison Of Clustered Rdf Data Stores, Venkata Patchigolla
Purdue Polytechnic Masters Theses
Storing data in RDF format helps in simpler data interchange among different researchers compared to present approaches. There has been tremendous increase in the applications that use RDF data. The nature of RDF data is such that it tends to increase explosively. This makes it necessary to consider the time for retrieval and scalability of data while selecting a suitable RDF data store for developing applications. The research concentrates on comparing BigOWLIM. Bigdata, 4store and Virtuoso RDF stores on basis of their scalability and performance of storing and retrieving cancer proteomics and mass spectrometry data using SPARQL queries. In this …