Zhang et al., 2015 - Google Patents
Vsep: A distributed algorithm for graph edge partitioningZhang et al., 2015
- Document ID
- 9992517286374336467
- Author
- Zhang Y
- Liu Y
- Yu J
- Liu P
- Guo L
- Publication year
- Publication venue
- Algorithms and Architectures for Parallel Processing: ICA3PP International Workshops and Symposiums, Zhangjiajie, China, November 18-20, 2015, Proceedings 15
External Links
Snippet
With the exponential growth of graph structured data in recent years, parallel distributed techniques play an increasingly important role in processing large-scale graphs. Since strong connections exist between vertices in graph data, the high communication cost for …
- 238000000638 solvent extraction 0 title abstract description 62
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30312—Storage and indexing structures; Management thereof
- G06F17/30321—Indexing structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30386—Retrieval requests
- G06F17/30424—Query processing
- G06F17/30533—Other types of queries
- G06F17/30545—Distributed queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30386—Retrieval requests
- G06F17/30424—Query processing
- G06F17/30442—Query optimisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30861—Retrieval from the Internet, e.g. browsers
- G06F17/30864—Retrieval from the Internet, e.g. browsers by querying, e.g. search engines or meta-search engines, crawling techniques, push systems
- G06F17/30867—Retrieval from the Internet, e.g. browsers by querying, e.g. search engines or meta-search engines, crawling techniques, push systems with filtering and personalisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30587—Details of specialised database models
- G06F17/30589—Hierarchical databases, e.g. IMS, LDAP data stores, Lotus Notes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
- G06F17/30961—Trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30575—Replication, distribution or synchronisation of data between databases or within a distributed database; Distributed database system architectures therefor
- G06F17/30584—Details of data partitioning, e.g. horizontal or vertical partitioning
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Onizuka et al. | Graph partitioning for distributed graph processing | |
US20140344287A1 (en) | Database controller, method, and program for managing a distributed data store | |
Gao et al. | Top-k team recommendation in spatial crowdsourcing | |
Adoni et al. | A survey of current challenges in partitioning and processing of graph-structured data in parallel and distributed systems | |
Juang et al. | Efficient algorithms for team formation with a leader in social networks | |
Moutafis et al. | Efficient processing of all-k-nearest-neighbor queries in the MapReduce programming framework | |
Guerrieri et al. | DFEP: Distributed funding-based edge partitioning | |
Zarezadeh et al. | DPNLP: distance based peripheral nodes label propagation algorithm for community detection in social networks | |
Tran et al. | S-PUT: An EA-based framework for socially aware data partitioning | |
Liu et al. | A feasible graph partition framework for parallel computing of big graph | |
Denis et al. | A distributed approach for graph-oriented multidimensional analysis | |
Davoudian et al. | A workload-adaptive streaming partitioner for distributed graph stores | |
Ji et al. | Scalable nearest neighbor query processing based on inverted grid index | |
Wang et al. | Link prediction based on community information and its parallelization | |
Leng et al. | BRGP: a balanced RDF graph partitioning algorithm for cloud storage | |
Zhang et al. | Vsep: A distributed algorithm for graph edge partitioning | |
Zhang et al. | Distance-aware selective online query processing over large distributed graphs | |
Warnke et al. | A SPARQL benchmark for distributed databases in IoT environments | |
Ryu et al. | MapReduce-based skyline query processing scheme using adaptive two-level grids | |
Fang et al. | Distributed stream join under workload variance | |
Li et al. | MR‐tree: an efficient index for MapReduce | |
Dou et al. | Unsupervised blocking and probabilistic parallelisation for record matching of distributed big data | |
Ajwani et al. | Co-optimizing application partitioning and network topology for a reconfigurable interconnect | |
Abdolazimi et al. | Connected components of big graphs in fixed mapreduce rounds | |
Meng et al. | Comparison of different centrality measures to find influential nodes in complex networks |