Databases
StackOverflow2013
Postsdbo
POWhat is the most efficient way to store and query trees?
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POWhat is the most efficient way to store and query trees?
    primarykey
    data
    text
    <p>I need to analyze 1 TB+ of web access logs, and in particular I need to analyze statistics relating to requested URLs and subsets of the URLs (child branches). If possible, I want the queries to be fast over small subsets of the data (e.g. 10 million requests).</p> <p>For example, given an access log with the following URLs being requested:</p> <pre><code>/ocp/about_us.html /ocp/security/ed-209/patches/urgent.html /ocp/security/rc/ /ocp/food/ /weyland-yutani/products/ </code></pre> <p>I want to do queries such as:</p> <ul> <li>Count the number of requests for everything 'below' /ocp. </li> <li>Same as above, but only count requests for child nodes under /ocp/security</li> <li>Return the top 5 most frequently requested URLs.</li> <li>Same as above, except group by an arbitrary depth,</li> </ul> <p>e.g. For the last query above, depth 2 for the data would return:</p> <pre><code>2: /ocp/security/ 1: /ocp/ 1: /ocp/food/ 1: /weyland-yutani/products/ </code></pre> <p>I think the ideal approach would probably be to use a column DB and tokenize the URLs such that there is a column for each element in the URL. However, I would really like to find a way to do this with open source apps if possible. HBase is a possibility, but query performance seems too slow to be useful for real-time queries (also, I don't really want to be in the business of re-implementing SQL)</p> <p>I'm aware there are commercial apps for doing this this type of analytics, but for various reasons I want to implement this myself.</p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. USRob
    1. USRob
    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. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POWhat is the most efficient way to store and query trees?
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POWhat is the most efficient way to store and query trees?
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. POWhat is the most efficient way to store and query trees?
      1. USMatthew Flaschen
      1. VTFavorite
    1. This table or related slice is empty.
 

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