147 search results - page 9 / 30 » Parallel Query Processing and Edge Ranking of Graphs |
IPPS
2002
IEEE
15 years 2 months ago
2002
IEEE
Query scheduling plays an important role when systems are faced with limited resources and high workloads. It becomes even more relevant for servers applying multiple query optimi...
TCS
2008
14 years 9 months ago
2008
Following the decontamination metaphor for searching a graph, we introduce a cleaning process, which is related to both the chip-firing game and edge searching. Brushes (instead o...
111
click to vote
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
To exploit the potential of multicore architectures, recent dense linear algebra libraries have used tile algorithms, which consist in scheduling a Directed Acyclic Graph (DAG) of...
IPL
2007
14 years 9 months ago
2007
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
97
Voted
ICDE
2012
IEEE
12 years 12 months ago
2012
IEEE
—Large graphs are used in many applications, such as social networking. The management of these graphs poses new challenges because such graphs are too large to fit on a single ...