Efficient Top-k Approximate Subtree Matching in Small Memory.
Nikolaus AugstenDenilson BarbosaMichael H. BöhlenThemis PalpanasPublished in: IEEE Trans. Knowl. Data Eng. (2011)
Keyphrases
- approximate matching
- matching algorithm
- memory space
- shape matching
- graph matching
- keypoints
- image matching
- memory size
- random access
- memory usage
- computational power
- matching process
- memory requirements
- template matching
- database
- pattern matching
- operating system
- feature points
- small number
- search algorithm
- case study
- website
- databases
- data sets