2498 search results - page 242 / 500 » Data Structures with Unpredictable Timing |
123
Voted
EDBT
2009
ACM
15 years 7 months ago
2009
ACM
In this paper, we propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem. Compared to the limitations of existing methods for the RkNN searc...
223
Voted
FCCM
2011
IEEE
14 years 6 months ago
2011
IEEE
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
178
Voted
AINA
2009
IEEE
15 years 9 months ago
2009
IEEE
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
103
Voted
SSDBM
2008
IEEE
15 years 9 months ago
2008
IEEE
Bitmap indexes are known to be efficient for ad-hoc range queries that are common in data warehousing and scientific applications. However, they suffer from the curse of cardina...
107
Voted
CONEXT
2008
ACM
15 years 4 months ago
2008
ACM
Virtual routers are a promising way to provide network services such as customer-specific routing, policy-based routing, multi-topology routing, and network virtulization. However...