Using LTREE type when the final node has ~1000 descendants, which exist under other final nodesWhat databases...
Is it ethical to recieve stipend after publishing enough papers?
What (the heck) is a Super Worm Equinox Moon?
Can I cause damage to electrical appliances by unplugging them when they are turned on?
What to do when eye contact makes your coworker uncomfortable?
Non-trope happy ending?
I found an audio circuit and I built it just fine, but I find it a bit too quiet. How do I amplify the output so that it is a bit louder?
The IT department bottlenecks progress, how should I handle this?
Why do Radio Buttons not fill the entire outer circle?
Why is it that I can sometimes guess the next note?
15% tax on $7.5k earnings. Is that right?
Does Doodling or Improvising on the Piano Have Any Benefits?
Why is so much work done on numerical verification of the Riemann Hypothesis?
Creating two special characters
Is it necessary to use pronouns with the verb "essere"?
How to draw a matrix with arrows in limited space
"before" and "want" for the same systemd service?
Shouldn’t conservatives embrace universal basic income?
Is there any evidence that Cleopatra and Caesarion considered fleeing to India to escape the Romans?
How to get directions in deep space?
Why the "ls" command is showing the permissions of files in a FAT32 partition?
Is this part of the description of the Archfey warlock's Misty Escape feature redundant?
Has the laser at Magurele, Romania reached a tenth of the Sun's power?
What are some good ways to treat frozen vegetables such that they behave like fresh vegetables when stir frying them?
Permission on Database
Using LTREE type when the final node has ~1000 descendants, which exist under other final nodes
What databases or styles of database can use git (or another dvcs architecture) to manage cross-site replication?Database redesign opportunity: What table design to use for this sensor data collection?UPDATE Query replacing string primary key taking days to resolvePL/pgSQL - Indexes vs Collation vs Pattern OpsDesign options for time series scientific dataVery Slow Inserts
Is it inappropriate to use LTREE type when the final node has ~1000 descendants, which exist under other final nodes?
My data is essentially a directory tree, with the final level containing text files which are just key-value pairs, for example:
Root>Region1>Exam1>Protocol1>alpha.txt
Root>Region1>Exam1>Protocol1>beta.txt
Root>Region1>Exam1>Protocol2>beta.txt
Root>Region1>Exam2>Protocol1>omega.txt
Root>Region2>Exam3>Protocol3>alpha.txt
The final text files will contain about 1000 keys which more or less exist in any of those text files but the value would be different.
This is my current structure:
|PATH | VALUE|
----------------------------------------------------
Root.Region1.Exam1.Protocol1.alpha.VARIABLE1 12
Root.Region1.Exam1.Protocol1.alpha.VARIABLE2 345
Root.Region1.Exam1.Protocol1.alpha.VARIABLE3 2345
Root.Region1.Exam1.Protocol1.beta.VARIABLE1 123
Root.Region1.Exam1.Protocol1.beta.VARIABLE2 'hello'
Root.Region1.Exam1.Protocol2.beta.VARIABLE1 'ff'
Root.Region1.Exam1.Protocol2.beta.VARIABLE2 303
I am not sure if this is sensible. My application is to monitor changes to those valuables on a daily basis. The number of rows is about 1 million not on day zero. These are then appended to every time any key-value pair changes.
Is that sensible?
postgresql database-design tree
New contributor
Haris is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
Is it inappropriate to use LTREE type when the final node has ~1000 descendants, which exist under other final nodes?
My data is essentially a directory tree, with the final level containing text files which are just key-value pairs, for example:
Root>Region1>Exam1>Protocol1>alpha.txt
Root>Region1>Exam1>Protocol1>beta.txt
Root>Region1>Exam1>Protocol2>beta.txt
Root>Region1>Exam2>Protocol1>omega.txt
Root>Region2>Exam3>Protocol3>alpha.txt
The final text files will contain about 1000 keys which more or less exist in any of those text files but the value would be different.
This is my current structure:
|PATH | VALUE|
----------------------------------------------------
Root.Region1.Exam1.Protocol1.alpha.VARIABLE1 12
Root.Region1.Exam1.Protocol1.alpha.VARIABLE2 345
Root.Region1.Exam1.Protocol1.alpha.VARIABLE3 2345
Root.Region1.Exam1.Protocol1.beta.VARIABLE1 123
Root.Region1.Exam1.Protocol1.beta.VARIABLE2 'hello'
Root.Region1.Exam1.Protocol2.beta.VARIABLE1 'ff'
Root.Region1.Exam1.Protocol2.beta.VARIABLE2 303
I am not sure if this is sensible. My application is to monitor changes to those valuables on a daily basis. The number of rows is about 1 million not on day zero. These are then appended to every time any key-value pair changes.
Is that sensible?
postgresql database-design tree
New contributor
Haris is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
Is it inappropriate to use LTREE type when the final node has ~1000 descendants, which exist under other final nodes?
My data is essentially a directory tree, with the final level containing text files which are just key-value pairs, for example:
Root>Region1>Exam1>Protocol1>alpha.txt
Root>Region1>Exam1>Protocol1>beta.txt
Root>Region1>Exam1>Protocol2>beta.txt
Root>Region1>Exam2>Protocol1>omega.txt
Root>Region2>Exam3>Protocol3>alpha.txt
The final text files will contain about 1000 keys which more or less exist in any of those text files but the value would be different.
This is my current structure:
|PATH | VALUE|
----------------------------------------------------
Root.Region1.Exam1.Protocol1.alpha.VARIABLE1 12
Root.Region1.Exam1.Protocol1.alpha.VARIABLE2 345
Root.Region1.Exam1.Protocol1.alpha.VARIABLE3 2345
Root.Region1.Exam1.Protocol1.beta.VARIABLE1 123
Root.Region1.Exam1.Protocol1.beta.VARIABLE2 'hello'
Root.Region1.Exam1.Protocol2.beta.VARIABLE1 'ff'
Root.Region1.Exam1.Protocol2.beta.VARIABLE2 303
I am not sure if this is sensible. My application is to monitor changes to those valuables on a daily basis. The number of rows is about 1 million not on day zero. These are then appended to every time any key-value pair changes.
Is that sensible?
postgresql database-design tree
New contributor
Haris is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Is it inappropriate to use LTREE type when the final node has ~1000 descendants, which exist under other final nodes?
My data is essentially a directory tree, with the final level containing text files which are just key-value pairs, for example:
Root>Region1>Exam1>Protocol1>alpha.txt
Root>Region1>Exam1>Protocol1>beta.txt
Root>Region1>Exam1>Protocol2>beta.txt
Root>Region1>Exam2>Protocol1>omega.txt
Root>Region2>Exam3>Protocol3>alpha.txt
The final text files will contain about 1000 keys which more or less exist in any of those text files but the value would be different.
This is my current structure:
|PATH | VALUE|
----------------------------------------------------
Root.Region1.Exam1.Protocol1.alpha.VARIABLE1 12
Root.Region1.Exam1.Protocol1.alpha.VARIABLE2 345
Root.Region1.Exam1.Protocol1.alpha.VARIABLE3 2345
Root.Region1.Exam1.Protocol1.beta.VARIABLE1 123
Root.Region1.Exam1.Protocol1.beta.VARIABLE2 'hello'
Root.Region1.Exam1.Protocol2.beta.VARIABLE1 'ff'
Root.Region1.Exam1.Protocol2.beta.VARIABLE2 303
I am not sure if this is sensible. My application is to monitor changes to those valuables on a daily basis. The number of rows is about 1 million not on day zero. These are then appended to every time any key-value pair changes.
Is that sensible?
postgresql database-design tree
postgresql database-design tree
New contributor
Haris is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Haris is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Haris is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 14 mins ago
HarisHaris
11
11
New contributor
Haris is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Haris is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Haris is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "182"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Haris is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fdba.stackexchange.com%2fquestions%2f232802%2fusing-ltree-type-when-the-final-node-has-1000-descendants-which-exist-under-ot%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Haris is a new contributor. Be nice, and check out our Code of Conduct.
Haris is a new contributor. Be nice, and check out our Code of Conduct.
Haris is a new contributor. Be nice, and check out our Code of Conduct.
Haris is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Database Administrators Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fdba.stackexchange.com%2fquestions%2f232802%2fusing-ltree-type-when-the-final-node-has-1000-descendants-which-exist-under-ot%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown