Research Article

Solving the Fragment Complexity of Official, Social, and Sensorial Urban Data

Algorithm 1

keyInquire.
Input: Attribute Y, ATree AT:
Output: Node N;
(1) codeY = encode(Y)
(2) node = AT.root()
(3) codeInquire = null
(4) nextNode + null
(5)for icodeY do
(6)  codeInquire = codeInquire.strcat(i)
(7)  nextNode = node.findNext(codeInquire)
(8)  if nextNodenull then
(9)   node = nextNode
(10)   codeInquire = null
(11)  end if
(12)end for
(13)if nextNode = = null then
(14)  node = node.wildCard()
(15)end if
(16)return node