1402 search results - page 243 / 281 » Sparse-Memory Graph Search |
125
Voted
EDBT
2004
ACM
16 years 2 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
121
Voted
ICFP
2008
ACM
16 years 2 months ago
2008
ACM
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
130
Voted
PLDI
2010
ACM
15 years 11 months ago
2010
ACM
Calling context--the set of active methods on the stack--is critical for understanding the dynamic behavior of large programs. Dynamic program analysis tools, however, are almost ...
112
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
150
click to vote
ICDCS
2009
IEEE
15 years 11 months ago
2009
IEEE
Users and administrators of large distributed systems are frequently in need of monitoring and management of its various components, data items and resources. Though there exist s...