664 search results - page 14 / 133 » Generalized Search Trees for Database Systems |
111
click to vote
SIGIR
2000
ACM
15 years 8 months ago
2000
ACM
The proliferation of online information resources increases the importance of effective and efficient distributed searching. Distributed searching is cast in three parts – datab...
144
click to vote
WADS
2005
Springer
15 years 9 months ago
2005
Springer
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
164
Voted
SIGMOD
2011
ACM
14 years 6 months ago
2011
ACM
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
133
Voted
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
We introduce an adversarial planning algorithm based on game tree search, which is applicable in large-scale multiplayer domains. In order to tackle the scalability issues of game...
146
Voted
KDD
2007
ACM
16 years 4 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...