Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>MSDN Lists these:</p> <ul> <li><a href="http://msdn.microsoft.com/en-us/library/xfhwa508.aspx" rel="noreferrer"><code>Dictionary&lt;,&gt;</code></a></li> <li><a href="http://msdn.microsoft.com/en-us/library/6sh2ey19.aspx" rel="noreferrer"><code>List&lt;&gt;</code></a></li> <li><a href="http://msdn.microsoft.com/en-us/library/system.collections.sortedlist.aspx" rel="noreferrer"><code>SortedList&lt;,&gt;</code></a> (edit: wrong link; here's the <a href="http://msdn.microsoft.com/en-us/library/ms132319.aspx" rel="noreferrer">generic version</a>)</li> <li><a href="http://msdn.microsoft.com/en-us/library/f7fta44c.aspx" rel="noreferrer"><code>SortedDictionary&lt;,&gt;</code></a></li> </ul> <p>etc. For example:</p> <blockquote> <p>The SortedList(TKey, TValue) generic class is a binary search tree with O(log n) retrieval, where n is the number of elements in the dictionary. In this, it is similar to the SortedDictionary(TKey, TValue) generic class. The two classes have similar object models, and both have O(log n) retrieval. Where the two classes differ is in memory use and speed of insertion and removal:</p> <p>SortedList(TKey, TValue) uses less memory than SortedDictionary(TKey, TValue).</p> <p>SortedDictionary(TKey, TValue) has faster insertion and removal operations for unsorted data, O(log n) as opposed to O(n) for SortedList(TKey, TValue).</p> <p>If the list is populated all at once from sorted data, SortedList(TKey, TValue) is faster than SortedDictionary(TKey, TValue).</p> </blockquote>
    singulars
    1. This table or related slice is empty.
    1. POAsymptotic complexity of .NET collection classes
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USMarc Gravell
    1. USMarc Gravell
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POAsymptotic complexity of .NET collection classes
      singulars
      1. PTQuestion
    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
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COIn this (old, deleted) quote a binary search tree is confused with a sorted array-based collection. http://en.wikipedia.org/wiki/Binary_search_tree
      singulars
      1. PO
      1. USStephan Eggermont
    2. CONote where they list the O notation. "The Dictionary<TKey, TValue> generic class provides a mapping from a set of keys to a set of values. Each addition to the dictionary consists of a value and its associated key. Retrieving a value by using its key is very fast, close to O(1), because the Dictionary<TKey, TValue> class is implemented as a hash table."
      singulars
      1. PO
      1. USChris Lucian
 

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