921 search results - page 32 / 185 » New Data Structures for Orthogonal Range Searching |
128
Voted
ACSC
2006
IEEE
15 years 10 months ago
2006
IEEE
Manipulating semistructured data, such as XML, does not t well within conventional programming languages. A typical manipulation requires nding all occurrences of a structure matc...
132
Voted
ERCIMDL
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The increase in the amount of data available in digital libraries calls for the development of search engines that allow the users to find quickly and effectively what ...
147
Voted
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...
129
click to vote
SIGCSE
1996
ACM
15 years 8 months ago
1996
ACM
The Binary Search Tree serves as an important example when teaching data structures. We explore new approaches to understanding the implementation of a Binary Search Tree, using c...
159
Voted
ICDM
2002
IEEE
15 years 8 months ago
2002
IEEE
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...