Retrieving Documents Related to Database Queries

2015 ◽  
pp. 498-510
Author(s):  
Vladimir Soares Catão ◽  
Marcus Costa Sampaio ◽  
Ulrich Schiel
Keyword(s):  
Database Queries

scholarly journals Multi-objective database queries in combined knapsack and set covering problem domains

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Sean A. Mochocki ◽  
Gary B. Lamont ◽  
Robert C. Leishman ◽  
Kyle J. Kauffman
Keyword(s):  
Relational Database ◽  
Set Covering ◽  
Covering Problem ◽  
Set Covering Problem ◽  
Database Queries ◽  
Multi Objective ◽  
Data Representations ◽  
Np Hard Problem ◽  
Institute Of Technology ◽  
The One

AbstractDatabase 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.

Comprehensive Analysis of Automatic Identification System (AIS) Data in Regard to Vessel Movement Prediction

2014 ◽  
Vol 67 (5) ◽  
pp. 791-809 ◽  
Author(s):  
Philipp Last ◽  
Christian Bahlke ◽  
Martin Hering-Bertram ◽  
Lars Linsen
Keyword(s):  
Large Data ◽  
Automatic Identification ◽  
Identification System ◽  
Very High Frequency ◽  
Database Queries ◽  
Related Data ◽  
Movement Prediction ◽  
Time Period ◽  
Current Usage ◽  
Exchange Vessel

AIS was primarily developed to exchange vessel-related data among vessels or AIS stations by using very-high frequency (VHF) technology to increase safety at sea. This study evaluates the formal integrity, availability, and the reporting intervals of AIS data with a focus on vessel movement prediction. In contrast to former studies, this study is based on a large data collection of over 85 million AIS messages, which were continuously received within a time period of two months. Thus, the evaluated data represent a comprehensive and up-to-date view of the current usage of AIS systems installed on vessels. Results of previous studies concerning the availability of AIS data are confirmed and extended. New aspects such as reporting intervals are additionally evaluated. Received messages are stored in a database, which allows for performing database queries to evaluate the obtained data in an automatic way. This study shows that almost ten years after becoming mandatory for professional operating vessels, AIS still lacks availability for both static and dynamic data and that the reporting intervals are not as reliable as specified within the technical AIS standard.

Reducing the communication complexity of quantum private database queries by subtle classical post-processing with relaxed quantum ability

2019 ◽  
Vol 81 ◽  
pp. 15-24 ◽  
Author(s):  
Yu-Guang Yang ◽  
Xue-Pei Guo ◽  
Gang Xu ◽  
Xiu-Bo Chen ◽  
Jian Li ◽  
...  
Keyword(s):  
Communication Complexity ◽  
Post Processing ◽  
Database Queries

Private database queries based on counterfactual quantum key distribution

2013 ◽  
Vol 88 (2) ◽  
Author(s):  
Jia-Li Zhang ◽  
Fen-Zhuo Guo ◽  
Fei Gao ◽  
Bin Liu ◽  
Qiao-Yan Wen
Keyword(s):  
Quantum Key Distribution ◽  
Key Distribution ◽  
Database Queries

scholarly journals A Methodology to Perform Semi-automatic Distributed EHR Database Queries

2018 ◽  
Author(s):  
Olga Fajarda ◽  
Luis Bastião Silva ◽  
Peter R. Rijnbeek ◽  
Michel Van Speybroeck ◽  
José Luis Oliveira
Keyword(s):  
Database Queries

scholarly journals MANAGEMENT DECISION MAKING USING AUTOMATED SYSTEM OF OPTIMUM STRUCTURE CHOICE FOR GROUND-SURFACE PUBLIC CONVEYANCES

2016 ◽  
Vol 2016 (3) ◽  
pp. 224-232
Author(s):  
Наталия Кузнецова ◽  
Nataliya Kuznetsova ◽  
Татьяна Карлова ◽  
Tatyana Karlova ◽  
Александр Бекмешов ◽  
...  
Keyword(s):  
Ground Surface ◽  
Automated System ◽  
Management Decision ◽  
Optimum Structure ◽  
Database Queries ◽  
Factors Affecting ◽  
Software Complex ◽  
Management Decision Making ◽  
Motion Speed ◽  
Definition Of

The article is devoted to the application of a special software complex for the definition of an opti-mum set of means of urban public groundsurface conveyances. In the paper are presented the existing software solutions meant for the definition of an optimum route, their basic merits and demerits are revealed, the methods for the solution of a problem in search of an op-timum set of means of ground surface public conveyance taking into account a maximum amount of factors affecting a motion speed are offered. The authors have presented a structure of an automated system for a choice of an optimum structure in ground surface public conveyances and also there are shown fragments of a corresponding program code and database queries. In the paper particular attention is paid to the working modes of an appendix presented, in particular, for the situation in the absence of customer’s device connection to the basic computer system.

Sign in / Sign up

Export Citation Format

Share Document