{ "items" : [
    { "id" : "http://dbpedia.org/resource/Trie"
      "properties" : {
        "http://www.w3.org/2000/01/rdf-schema#comment" : [ "In computer science, a trie, also called digital tree and sometimes radix tree or prefix tree (as they can be searched by prefixes), is an ordered tree data structure that is used to store a dynamic set or associative array where the keys are usually strings. Unlike a binary search tree, no node in the tree stores the key associated with that node; instead, its position in the tree defines the key with which it is associated." ] ,
        "http://xmlns.com/foaf/0.1/depiction" : [ "http://commons.wikimedia.org/wiki/Special:FilePath/Trie_example.svg" ] ,
        "http://dbpedia.org/ontology/thumbnail" : [ "http://commons.wikimedia.org/wiki/Special:FilePath/Trie_example.svg?width=300"] } } }
