Closed. This question is opinion-based. It is not currently accepting answers.
Want to improve this question? Update the question so it can be answered with facts and citations by editing this post.
Closed 8 years ago.
Improve this question
This is more of a theoretical question. Suppose we have a MySQL DB with n number of tables. Out of these m tables are possible to join (n-m tables cannot be joined on a key or won't even make any sense to join them). Given this; is there a finite number of MySQL queries possible for this DB and if so, how do we determine that number?
SQL is a constructive grammar and therefore has an limitless number of queries.
It doesn't matter how many tables are involved.
Related
Closed. This question is opinion-based. It is not currently accepting answers.
Want to improve this question? Update the question so it can be answered with facts and citations by editing this post.
Closed 1 year ago.
Improve this question
I want to design a database which is going to consists of really lot of columns, since it's a web game's inventory but there is going to be really lot of things.
It would probably call for names like "item_1", "item_2" but is that even ideal?
When I plan it to be extended over 1 000 items?
I need to SELECT later if the user has them, every single one.
I plan to use MariaDB and Laravel framework with Jetstream, Livewire and Tailwind.css.
Before you do anything, read about
NF
1NF
2NF
3NF
BCNF
Bearing in mind the knowledge you thusly accumulate, you should reach to a conclusion similar to having some tables like these:
item_types(id, name, ...)
user(username, password, ...)
inventory(user_id, item_type_id, amount)
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 3 years ago.
Improve this question
I have two databases one in PostgreSQL and other in MySQL. What I want is to get data from both databases and create a view and then iterate it on front-end.
Is it possible?.
The smartest thing to do would be to create two connections, one to each database, and handle it that way.
If you need to join the tables, you could consider using a mysql_fdw foreign table in PostgreSQL and join the tables in PostgreSQL.
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 7 years ago.
Improve this question
A number of algorithms e.g. HRJN (Hash Rank Join:https://cs.uwaterloo.ca/~ilyas/papers/rank_join2.pdf) have been proposed in relational databases for ranking and retrieving top-K results. Does any open source relational database like postgresql implement such algorithm by default (If yes what is the database name?).
Closed. This question needs details or clarity. It is not currently accepting answers.
Want to improve this question? Add details and clarify the problem by editing this post.
Closed 7 years ago.
Improve this question
How many records can be possible & how many maximum records can be effective in mysql?
Actually my table has
24 Tables
1000000 Rows in Table (Each table (max))
Can I use mysql, please help me to solve my problem.
Yes you can use mysql perfectly.
One million rows (AKA records) is not too much for mysql, if you index that.
Closed. This question is opinion-based. It is not currently accepting answers.
Want to improve this question? Update the question so it can be answered with facts and citations by editing this post.
Closed 9 years ago.
Improve this question
I have a table(A) which contains texts(there is no any text length limitation and text counts can be more than 2000) and another table(B), which contains maximum 2000 static words.
I need to find occurrences of words from table B in texts of table A. And now, I am thinking about 2 possible solutions:
Store the words of table A in array and apply Knuth-Moriss-Prat algorithm to find occurrences.
Store the words of table A in array and use SQL "WHERE" condition to find occurrences.
Which method would you suggest for such kind of problem?
Store the b words in a hash table, then look up each A word in it.