Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
This tag is for general database questions. If you question is specific to SQL or NoSQL, use the corresponding tags instead.
2
votes
Accepted
Design pattern for access to tree-like database in Java?
Using a tree in a normal (relational) database is difficult. … This can be solved somewhat by de-normalizing the database (adding columns to provide a complete ancestry for each skill) but then you have to know the maximum number of levels in your tree and hard-wire …
7
votes
At what size of data does it become beneficial to move from SQL to NoSQL?
Note that if one of these sets of data becomes too big to fit into memory, your non-SQL database doesn't work any more. … If your relational database is going to cause you problems, it will do so before you've put much data into it. …
1
vote
Accepted
In-memory DB to perform intersects on set slices
Java provides Treemap. In that language, I'd put the cars in one Map keyed by price and one keyed by engine size. Pull the desired set from one of the "tables" and put it in an easily searchable col …
5
votes
Is there any reason to use varchar over text columns in a database?
So your database wants you to give it a clue so it can give you a gigabyte of results from terrabytes of data in microseconds. … If you're not using your database that hard, you won't need the speed it's offering and will be annoyed at the needless questions. …