Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    singulars
    1. This table or related slice is empty.
    1. POMost efficient/fastest way to get a single file from a directory
      singulars
      1. PTQuestion
    1. PTAnswer
    1. This table or related slice is empty.
    1. USLucas Moeskops
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COThis is not a solution: I would still have to list all the folders, and then list all the files in the subdirectory I will access to know how many pregenerated files are still left to choose to either delete the folder or not. If I don't do that, in the long run I will get a lot of empty folders, which I will still walk and waste CPU cycles.
      singulars
      1. PO
      1. USgaborous
    2. CONot true. Listing the folders will take not too much time, because only n folders to list. Then you descend from folder into folder until you find a file. After use you delete the file and check if folder is empty. If so delete the folder. Do this recursively and you will drastically reduce amount of files listed. (What I meant is you divide the files over the folders recursively, so folders can contain subfolders as well.) This will reduce the files you list from O(N) to O(n-root(N)) if I'm correct.
      singulars
      1. PO
      1. USLucas Moeskops
    3. COok I get your point. In fact, if we stretch the idea to its maximum, it's a kind of recursive algorithm, but for file placement instead of data processing: to maximize its potential, we can put every file in its own folder (so one file per folder!) and every 2 folders are recursively placed inside one folder. This way, we would create a tree, of log2(N) number of levers (the root being N/2**log2(N)). The complexity would be something like O(n*log2(N)) but we have to use the Master Theorem to get more precise. (continued in the next comment)
      singulars
      1. PO
      1. USgaborous
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload