Document Type
Article
Publication Date
3-2021
Abstract
Database queries are one of the most important functions of a relational database. Users are interested in viewing a variety of data representations, and this may vary based on database purpose and the nature of the stored data. The Air Force Institute of Technology has approximately 100 data logs which will be converted to the standardized Scorpion Data Model format. A relational database is designed to house this data and its associated sensor and non-sensor metadata. Deterministic polynomial-time queries were used to test the performance of this schema against two other schemas, with databases of 100 and 1000 logs of repeated data and randomized metadata. Of these approaches, the one that had the best performance was chosen as AFIT’s database solution, and now more complex and useful queries need to be developed to enable filter research. To this end, consider the combined Multi-Objective Knapsack/Set Covering Database Query. Algorithms which address The Set Covering Problem or Knapsack Problem could be used individually to achieve useful results, but together they could offer additional power to a potential user. This paper explores the NP-Hard problem domain of the Multi-Objective KP/SCP, proposes Genetic and Hill Climber algorithms, implements these algorithms using Java, populates their data structures using SQL queries from two test databases, and finally compares how these algorithms perform.
DOI
10.1186/s40537-021-00433-x
Source Publication
Journal of Big Data (e-ISSN 2196-1115)
Recommended Citation
Mochocki, S. A., Lamont, G. B., Leishman, R. C., & Kauffman, K. J. (2021). Multi-objective database queries in combined knapsack and set covering problem domains. Journal of Big Data, 8(1), Art. 46. https://doi.org/10.1186/s40537-021-00433-x
Comments
© 2021, The Author(s).
This article is published by SpringerOpen, licensed under a Creative Commons Attribution 4.0 International License (CC BY 4.0), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Sourced from the published version of record cited below. .
Please fully attribute the citation below, including DOI in any re-use.