KI-Glossar
Das vollständige Wörterbuch der Künstlichen Intelligenz
Apache Giraph
Iterative graph processing system based on the Pregel model, designed to run graph algorithms on Hadoop clusters with billions of nodes and edges.
Pregel
Synchronous programming model for distributed graph processing developed by Google, using a message-passing approach between vertices for iterative computations.
GraphFrames
Graph processing API for Apache Spark that combines the advantages of DataFrames and GraphX, offering SQL graph queries and integration with the Spark ecosystem.
Flink Gelly
Apache Flink's graph processing library providing methods and algorithms for large-scale graph analysis with iterative transformations and graph operators.
Vertex-Centric Model
Programming paradigm where computations are defined at the vertex level, with each vertex processing incoming messages and sending messages to neighboring vertices at each superstep.
Graph Partitioning
Technique for distributing vertices and edges of a graph across multiple machines to minimize inter-node communication while balancing workload.
Superstep
Synchronous execution phase in Pregel models where each vertex performs parallel computations, sends messages, and waits for all vertices to complete before moving to the next step.
Bulk Synchronous Parallel
Parallel computing model composed of synchronized supersteps where all processors perform local computations then engage in global communication before proceeding to the next step.
Graph Traversal
Systematic process of visiting vertices and edges of a graph in a specific order, essential for search and path analysis algorithms.
Message Passing Interface
Standard communication protocol allowing processes to exchange messages in distributed systems, fundamental for parallel graph processing.
Property Graph
Graph model where vertices and edges can have arbitrary properties as key-value pairs, enabling rich and complex data queries.
Gremlin
Functional and imperative graph traversal language part of Apache TinkerPop, allowing expression of complex queries on graph databases.
Apache TinkerPop
Open source graph computing framework providing a unified API, query languages like Gremlin, and a technology stack for the graph database ecosystem.
Community Detection
Set of algorithms aimed at identifying groups of densely connected nodes in a graph, revealing underlying structures in social and biological networks.
Triangle Counting
Fundamental algorithm for measuring local cohesion in graphs by counting triplets of mutually connected nodes, a key indicator of network density.
Graph Coloring
Combinatorial optimization problem consisting of assigning colors to vertices of a graph so that two adjacent vertices never have the same color.