paper-with-me

홈 › Papers

The Optimization of Running Queries in Relational Databases Using ANT-Colony Algorithm

2013-11-16 · Adel Alinezhad Kolaei, Marzieh Ahmadzadeh

The issue of optimizing queries is a cost-sensitive process and with respect to the number of associated tables in a query, its number of permutations grows exponentially. On one hand, in comparison with other operators in relational database, join operator is the most difficult and complicated one in terms of optimization for reducing its runtime. Accordingly, various algorithms have so far been proposed to solve this problem. On the other hand, the success of any database management system (DBMS) means exploiting the query model. In the current paper, the heuristic ant algorithm has been proposed to solve this problem and improve the runtime of join operation. Experiments and observed results reveal the efficiency of this algorithm compared to its similar algorithms.

📄 PDF Abstract BibTeX arXiv:1311.4088

Code (0)

등록된 구현이 없습니다.

Tasks

Management

Similar Papers 제목 키워드 기반

Cognitive Database: A Step towards Endowing Relational Databases with Artificial Intelligence Capabilities

2017-12-19 · Rajesh Bordawekar, Bortik Bandyopadhyay, Oded Shmueli

We propose Cognitive Databases, an approach for transparently enabling Artificial Intelligence (AI) capabilities in relational databases. A novel aspect of our design is to first view the structured data source as meanin…

BERT Meets Relational DB: Contextual Representations of Relational Databases

2021-04-30 · Siddhant Arora, Vinayak Gupta, Garima Gaur, Srikanta Bedathur

In this paper, we address the problem of learning low dimension representation of entities on relational databases consisting of multiple tables. Embeddings help to capture semantics encoded in the database and can be us…

Missing ValuesRepresentation Learning

Symbolic Querying of Vector Spaces: Probabilistic Databases Meets Relational Embeddings

2020-02-24 · Tal Friedman, Guy Van Den Broeck

We propose unifying techniques from probabilistic databases and relational embedding models with the goal of performing complex queries on incomplete and uncertain data. We formalize a probabilistic database model with r…

Hybrid Querying Over Relational Databases and Large Language Models

2024-08-01 · Fuheng Zhao, Divyakant Agrawal, Amr El Abbadi

Database queries traditionally operate under the closed-world assumption, providing no answers to questions that require information beyond the data stored in the database. Hybrid querying using SQL offers an alternative…

Incorporating Deep Learning Design in Database Queries

2026-05-22 · Yuval Lev Lubarsky, Dean Light, Boaz Berger, Shunit Agmon 외 arxiv

Deep learning over relational databases is conventionally realized by translating data into graph representations and applying graph-based neural networks within external frameworks. This round-trip between the database …