WikiData Processing

Data Accessing

To download latest-all.json.bz2 on the page https://dumps.wikimedia.org/wikidatawiki/entities/ .

wget is the best tool to download huge file:

wget -c -t 0 https://dumps.wikimedia.org/wikidatawiki/entities/latest-all.json.bz2

Installing Neo4j on Ubuntu

From Repositories (Not recommended)

This way needs supervisor authority, which is inconvenient.

Step 1. (Optional) To install OpenJRE and OpenJDK firstly, if there are no Java runtime environment on the computer.

$ sudo apt-get update
$ sudo apt-get install default-jre
$ sudo apt-get install default-jdk

Step 2. Installing Neo4j.

To use the repository add it to the list of sources:

$ wget -O - https://debian.neo4j.org/neotechnology.gpg.key | sudo apt-key add -
$ echo 'deb https://debian.neo4j.org/repo stable/' | sudo tee /etc/apt/sources.list.d/neo4j.list
$ sudo apt-get update

To install the latest Neo4j Community Edition:

$ sudo apt-get install neo4j

User Installation

To extract files from neo4j-community-3.5.8-unix.tar.gz

$ tar zxvf neo4j-community-3.5.8-unix.tar.gz

Adding follow lines to ~/.bashrc, and 'source' it.

# neo4j
export NEO4J_HOME="/home/fyb/neo4j-community-3.5.8"
export PATH=$PATH:$NEO4J_HOME/bin

To open remote accessing authority.

$ vi neo4j-community-3.5.8/conf/neo4j.conf

change #dbms.connector.http.listen_address=:7474
to dbms.connector.http.listen_address=0.0.0.0:7474 change #dbms.connector.bolt.listen_address=:7687
to dbms.connector.bolt.listen_address=0.0.0.0:7687

To start service, <NEO4J_HOME> is the top level directory referred to neo4j-community-3.5.8

$ neo4j console

Installing NodeJs

Node.js v12.x:

$ curl -sL https://deb.nodesource.com/setup_12.x | sudo -E bash -
$ sudo apt-get install -y nodejs

Importing

We employ wikidata-neo4j-importer to import wikidata into neo4J.

https://github.com/findie/wikidata-neo4j-importer

some requirements need to be installed.

$ npm install neo4j-driver async n-readlines cli-color slugify

Now, we can run index.js to import WikiData into neo4j !

$ node index.js

Bibliography

http://debian.neo4j.org/

https://github.com/nodesource/distributions/blob/master/README.md#deb

https://neo4j.com/download-thanks/?edition=community&release=3.5.8&flavour=unix

WikiData Processing的更多相关文章

  1. OLTP(on-line transaction processing)与OLAP(On-Line Analytical Processing)

    OLTP与OLAP的介绍 数据处理大致可以分成两大类:联机事务处理OLTP(on-line transaction processing).联机分析处理OLAP(On-Line Analytical ...

  2. 新书到手 TRANSACTION PROCESSING:CONCEPTS AND TECHNIQUES

    新书到手 TRANSACTION PROCESSING:CONCEPTS AND TECHNIQUES Jim Gray大神的著作 本文版权归作者所有,未经作者同意不得转载.

  3. Report processing of Microsoft Dynamic AX

    Report processing of Microsoft Dynamic AX 版权声明:本文为博主原创文章,未经博主允许不得转载. The implementation of a general ...

  4. ANNOTATION PROCESSING 101 by Hannes Dorfmann — 10 Jan 2015

    原文地址:http://hannesdorfmann.com/annotation-processing/annotationprocessing101 In this blog entry I wo ...

  5. ORA-01078: failure in processing system parameters & LRM-00109: could not open parameter file

    安装了Oracle 12C后,启动数据库的过程中出现如下错误 SQL> startup ORA-01078: failure in processing system parameters LR ...

  6. Processing基础之绘画

    图形 //在(x, y)绘制点 point(x, y); //(x1, y1)到(x2, y2)的一条线 line(x1, y1, x2, y2); rect(x, y, weight, height ...

  7. 【目录】processing

    Processing 小代码 小代码2 小代码3 小代码4 小代码5

  8. 转债---Pregel: A System for Large-Scale Graph Processing(译)

    转载:http://duanple.blog.163.com/blog/static/70971767201281610126277/   作者:Grzegorz Malewicz, Matthew ...

  9. 【Duke-Image】Week_3 Spatial processing

    Chapter_3 Intensity Transsformations and Spatial Filtering 灰度变换与空间滤波 Intensity transformation functi ...

随机推荐

  1. 常用的排序算法介绍和在JAVA的实现(一)

    一.写随笔的原因:排序比较常用,借此文介绍下排序常用的算法及实现,借此来MARK一下,方便以后的复习.(本人总是忘得比较快) 二.具体的内容: 1.插入排序 插入排序:在前面已经排好序的序列中找到合适 ...

  2. Linux 配置:Xmanager连接Linux图形界面

    想要在远程终端使用用图形界面来操作和控制Linux服务器,就在windows下像使用MSTSC一样.linux通过XDMCP来提供这种支持,我们只要用一个终端仿真软件如:xmanager就可以实现,但 ...

  3. nginx_rtmp

    rtmp { server { listen ; chunk_size ; max_connections ; #音视频流上传和播放地址都是 rtmp://你的IP/live/streamName # ...

  4. glsl:error C1105: cannot call a non-function

    今天写的shader编译过程中报了这个错误,而且错误行数是0.原因怎么找也找不到.后来发现原来是normalize方法写成了了normal正好和函数的形参名字一样. 特地记录一下.

  5. 架构师成长之路5.4-Saltstack配置管理(LAMP架构案例)

    点击架构师成长之路 架构师成长之路5.4-Saltstack配置管理(LAMP架构案例) 配置管理工具: Pupper:1. 采用ruby编程语言:2. 安装环境相对较复杂:3.不支持远程执行,需要F ...

  6. Share:《THE ULTIMATE XSS PROTECTION CHEATSHEET FOR DEVELOPERS》

    Ajin Abraham(OWASP Xenotix XSS Exploit Framework的作者哦!)编写的<THE ULTIMATE XSS PROTECTION CHEATSHEET ...

  7. 【hdu 6089】Rikka with Terrorist

    题意 有一个 \(n\times m\) 的二维网格,其中有 \(k\) 个禁止点. 有 \(q\) 组询问,每组询问为给一个点,求有多少个矩形以这个点为一角且不包含禁止点. \(n,m,k,q\le ...

  8. tomcat 搭建网站

    基本概念 JDK(Java Development Kit)是Sun Microsystems针对Java开发人员的产品.自从Java推出以来,JDK已经成为使用最广泛的Java SDK.JDK 是整 ...

  9. HDU - 6583 Typewriter (后缀自动机+dp)

    题目链接 题意:你要打印一段字符串,往尾部添加一个字符需要花费p元,复制一段字符到尾部需要花费q元,求打印完全部字符的最小花费. 一开始想的贪心,后来发现忘了考虑p<q的情况了,还纳闷怎么不对. ...

  10. 【银川网络赛G】Factories

    题目大意:给定一棵 N 个节点的树,边有边权,选定 M 个叶子节点,使得任意两个叶子节点的树上距离之和最小,求最小值是多少. 题解:任意两点的树上距离和问题应从边的贡献角度考虑. 设 \(f[u][i ...