664 search results - page 4 / 133 » Generalized Search Trees for Database Systems |
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
The indexing of complex data and similarity search plays an important role in many application areas. Traditional centralized index structure can not scale with the rapid prolifer...
105
click to vote
ENTCS
2008
14 years 12 months ago
2008
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
ISAAC
2009
Springer
15 years 6 months ago
2009
Springer
Many database systems that use a B+ tree as the underlying data structure do not do rebalancing on deletion. This means that a bad sequence of deletions can create a very unbalance...
IROS
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— This paper presents a novel method for sensorbased exploration of unknown environments by a general robotic system equipped with multiple sensors. The method is based o...
AAAI
2004
15 years 1 months ago
2004
Since the state space of most games is a directed graph, many game-playing systems detect repeated positions with a transposition table. This approach can reduce search effort by ...