-
Notifications
You must be signed in to change notification settings - Fork 126
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
chore: add performance test for quoted triples
- Loading branch information
Showing
2 changed files
with
236 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,118 @@ | ||
| #!/usr/bin/env node | ||
| const N3 = require('..'); | ||
| const assert = require('assert'); | ||
|
|
||
| console.log('N3Store performance test'); | ||
|
|
||
| const prefix = 'http://example.org/#'; | ||
|
|
||
| /* Test triples */ | ||
| const dim = Number.parseInt(process.argv[2], 10) || 22; | ||
| const dimSquared = dim * dim; | ||
| const dimCubed = dimSquared * dim; | ||
| const dimToTheFour = dimCubed * dim; | ||
| const dimToTheFive = dimToTheFour * dim; | ||
|
|
||
| const store = new N3.Store(); | ||
| let TEST = `- Adding ${dimToTheFive} triples to the default graph`; | ||
| console.time(TEST); | ||
| let i, j, k, l, m; | ||
| for (i = 0; i < dim; i++) | ||
| for (j = 0; j < dim; j++) | ||
| for (k = 0; k < dim; k++) | ||
| for (l = 0; l < dim; l++) | ||
| for (m = 0; m < dim; m++) | ||
| store.addQuad( | ||
| N3.DataFactory.quad( | ||
| N3.DataFactory.namedNode(prefix + i), | ||
| N3.DataFactory.namedNode(prefix + j), | ||
| N3.DataFactory.namedNode(prefix + k) | ||
| ), | ||
| N3.DataFactory.namedNode(prefix + l), | ||
| N3.DataFactory.namedNode(prefix + m) | ||
| ); | ||
| console.timeEnd(TEST); | ||
|
|
||
| console.log(`* Memory usage for triples: ${Math.round(process.memoryUsage().rss / 1024 / 1024)}MB`); | ||
|
|
||
| TEST = `- Finding all ${dimToTheFive} triples in the default graph ${dimSquared * 1} times (0 variables)`; | ||
| console.time(TEST); | ||
| for (i = 0; i < dim; i++) | ||
| for (j = 0; j < dim; j++) | ||
| for (k = 0; k < dim; k++) | ||
| for (l = 0; l < dim; l++) | ||
| for (m = 0; m < dim; m++) | ||
| assert.equal(store.getQuads( | ||
| N3.DataFactory.quad( | ||
| N3.DataFactory.namedNode(prefix + i), | ||
| N3.DataFactory.namedNode(prefix + j), | ||
| N3.DataFactory.namedNode(prefix + k) | ||
| ), | ||
| N3.DataFactory.namedNode(prefix + l), | ||
| N3.DataFactory.namedNode(prefix + m) | ||
| ).length, 1); | ||
| console.timeEnd(TEST); | ||
|
|
||
| TEST = `- Finding all ${dimCubed} triples in the default graph ${dimSquared * 2} times (1 variable subject)`; | ||
| console.time(TEST); | ||
| for (i = 0; i < dim; i++) | ||
| for (j = 0; j < dim; j++) | ||
| assert.equal(store.getQuads(null, N3.DataFactory.namedNode(prefix + i), N3.DataFactory.namedNode(prefix + j)).length, dimCubed); | ||
| console.timeEnd(TEST); | ||
|
|
||
| TEST = `- Finding all ${0} triples in the default graph ${dimSquared * 2} times (1 variable predicate)`; | ||
| console.time(TEST); | ||
| for (i = 0; i < dim; i++) | ||
| for (j = 0; j < dim; j++) | ||
| assert.equal(store.getQuads(N3.DataFactory.namedNode(prefix + i), null, N3.DataFactory.namedNode(prefix + j)).length, 0); | ||
| console.timeEnd(TEST); | ||
|
|
||
| TEST = `- Finding all ${dim} triples in the default graph ${dimSquared * 4} times (1 variable predicate)`; | ||
| console.time(TEST); | ||
| for (i = 0; i < dim; i++) | ||
| for (j = 0; j < dim; j++) | ||
| for (k = 0; k < dim; k++) | ||
| for (l = 0; l < dim; l++) | ||
| assert.equal(store.getQuads(N3.DataFactory.quad( | ||
| N3.DataFactory.namedNode(prefix + i), | ||
| N3.DataFactory.namedNode(prefix + j), | ||
| N3.DataFactory.namedNode(prefix + k) | ||
| ), null, N3.DataFactory.namedNode(prefix + l)).length, dim); | ||
| console.timeEnd(TEST); | ||
|
|
||
| TEST = `- Finding all ${0} triples in the default graph ${dimSquared * 2} times (1 variable object)`; | ||
| console.time(TEST); | ||
| for (i = 0; i < dim; i++) | ||
| for (j = 0; j < dim; j++) | ||
| assert.equal(store.getQuads(N3.DataFactory.namedNode(prefix + i), N3.DataFactory.namedNode(prefix + j), null).length, 0); | ||
| console.timeEnd(TEST); | ||
|
|
||
| TEST = `- Finding all ${dim} triples in the default graph ${dimSquared * 4} times (1 variable objects)`; | ||
| console.time(TEST); | ||
| for (i = 0; i < dim; i++) | ||
| for (j = 0; j < dim; j++) | ||
| for (k = 0; k < dim; k++) | ||
| for (l = 0; l < dim; l++) | ||
| assert.equal(store.getQuads(N3.DataFactory.quad( | ||
| N3.DataFactory.namedNode(prefix + i), | ||
| N3.DataFactory.namedNode(prefix + j), | ||
| N3.DataFactory.namedNode(prefix + k) | ||
| ), N3.DataFactory.namedNode(prefix + l), null).length, dim); | ||
| console.timeEnd(TEST); | ||
|
|
||
| TEST = `- Finding all ${dimSquared} triples in the default graph ${dimSquared * 1} times (2 variables)`; | ||
| console.time(TEST); | ||
| for (i = 0; i < dim; i++) | ||
| for (j = 0; j < dim; j++) | ||
| for (k = 0; k < dim; k++) | ||
| assert.equal(store.getQuads( | ||
| N3.DataFactory.quad( | ||
| N3.DataFactory.namedNode(prefix + i), | ||
| N3.DataFactory.namedNode(prefix + j), | ||
| N3.DataFactory.namedNode(prefix + k) | ||
| ), | ||
| null, | ||
| null | ||
| ).length, | ||
| dimSquared); | ||
| console.timeEnd(TEST); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,118 @@ | ||
| #!/usr/bin/env node | ||
| const N3 = require('../lib'); | ||
| const assert = require('assert'); | ||
|
|
||
| console.log('N3Store performance test'); | ||
|
|
||
| const prefix = 'http://example.org/#'; | ||
|
|
||
| /* Test triples */ | ||
| const dim = Number.parseInt(process.argv[2], 10) || 64; | ||
| const dimSquared = dim * dim; | ||
| const dimCubed = dimSquared * dim; | ||
| const dimToTheFour = dimCubed * dim; | ||
| const dimToTheFive = dimToTheFour * dim; | ||
|
|
||
| const store = new N3.Store(); | ||
| let TEST = `- Adding ${dimToTheFive} triples to the default graph`; | ||
| console.time(TEST); | ||
| let i, j, k, l, m; | ||
| for (i = 0; i < dim; i++) | ||
| for (j = 0; j < dim; j++) | ||
| for (k = 0; k < dim; k++) | ||
| for (l = 0; l < 3; l++) | ||
| for (m = 0; m < 3; m++) | ||
| store.addQuad( | ||
| N3.DataFactory.quad( | ||
| N3.DataFactory.namedNode(prefix + i), | ||
| N3.DataFactory.namedNode(prefix + j), | ||
| N3.DataFactory.namedNode(prefix + k) | ||
| ), | ||
| N3.DataFactory.namedNode(prefix + l), | ||
| N3.DataFactory.namedNode(prefix + m) | ||
| ); | ||
| console.timeEnd(TEST); | ||
|
|
||
| console.log(`* Memory usage for triples: ${Math.round(process.memoryUsage().rss / 1024 / 1024)}MB`); | ||
|
|
||
| TEST = `- Finding all ${dimToTheFive} triples in the default graph ${dimSquared * 1} times (0 variables)`; | ||
| console.time(TEST); | ||
| for (i = 0; i < dim; i++) | ||
| for (j = 0; j < dim; j++) | ||
| for (k = 0; k < dim; k++) | ||
| for (l = 0; l < 3; l++) | ||
| for (m = 0; m < 3; m++) | ||
| assert.equal(store.getQuads( | ||
| N3.DataFactory.quad( | ||
| N3.DataFactory.namedNode(prefix + i), | ||
| N3.DataFactory.namedNode(prefix + j), | ||
| N3.DataFactory.namedNode(prefix + k) | ||
| ), | ||
| N3.DataFactory.namedNode(prefix + l), | ||
| N3.DataFactory.namedNode(prefix + m) | ||
| ).length, 1); | ||
| console.timeEnd(TEST); | ||
|
|
||
| TEST = `- Finding all ${dimCubed} triples in the default graph ${dimSquared * 2} times (1 variable subject)`; | ||
| console.time(TEST); | ||
| for (i = 0; i < 3; i++) | ||
| for (j = 0; j < 3; j++) | ||
| assert.equal(store.getQuads(null, N3.DataFactory.namedNode(prefix + i), N3.DataFactory.namedNode(prefix + j)).length, dimCubed); | ||
| console.timeEnd(TEST); | ||
|
|
||
| TEST = `- Finding all ${0} triples in the default graph ${dimSquared * 2} times (1 variable predicate)`; | ||
| console.time(TEST); | ||
| for (i = 0; i < dim; i++) | ||
| for (j = 0; j < dim; j++) | ||
| assert.equal(store.getQuads(N3.DataFactory.namedNode(prefix + i), null, N3.DataFactory.namedNode(prefix + j)).length, 0); | ||
| console.timeEnd(TEST); | ||
|
|
||
| TEST = `- Finding all ${3} triples in the default graph ${dimCubed * 3} times (1 variable predicate)`; | ||
| console.time(TEST); | ||
| for (i = 0; i < dim; i++) | ||
| for (j = 0; j < dim; j++) | ||
| for (k = 0; k < dim; k++) | ||
| for (l = 0; l < 3; l++) | ||
| assert.equal(store.getQuads(N3.DataFactory.quad( | ||
| N3.DataFactory.namedNode(prefix + i), | ||
| N3.DataFactory.namedNode(prefix + j), | ||
| N3.DataFactory.namedNode(prefix + k) | ||
| ), null, N3.DataFactory.namedNode(prefix + l)).length, 3); | ||
| console.timeEnd(TEST); | ||
|
|
||
| TEST = `- Finding all ${0} triples in the default graph ${dimSquared * 2} times (1 variable object)`; | ||
| console.time(TEST); | ||
| for (i = 0; i < dim; i++) | ||
| for (j = 0; j < dim; j++) | ||
| assert.equal(store.getQuads(N3.DataFactory.namedNode(prefix + i), N3.DataFactory.namedNode(prefix + j), null).length, 0); | ||
| console.timeEnd(TEST); | ||
|
|
||
| TEST = `- Finding all ${3} triples in the default graph ${dimCubed * 3} times (1 variable objects)`; | ||
| console.time(TEST); | ||
| for (i = 0; i < dim; i++) | ||
| for (j = 0; j < dim; j++) | ||
| for (k = 0; k < dim; k++) | ||
| for (l = 0; l < 3; l++) | ||
| assert.equal(store.getQuads(N3.DataFactory.quad( | ||
| N3.DataFactory.namedNode(prefix + i), | ||
| N3.DataFactory.namedNode(prefix + j), | ||
| N3.DataFactory.namedNode(prefix + k) | ||
| ), N3.DataFactory.namedNode(prefix + l), null).length, 3); | ||
| console.timeEnd(TEST); | ||
|
|
||
| TEST = `- Finding all ${9} triples in the default graph ${dimCubed} times (2 variables)`; | ||
| console.time(TEST); | ||
| for (i = 0; i < dim; i++) | ||
| for (j = 0; j < dim; j++) | ||
| for (k = 0; k < dim; k++) | ||
| assert.equal(store.getQuads( | ||
| N3.DataFactory.quad( | ||
| N3.DataFactory.namedNode(prefix + i), | ||
| N3.DataFactory.namedNode(prefix + j), | ||
| N3.DataFactory.namedNode(prefix + k) | ||
| ), | ||
| null, | ||
| null | ||
| ).length, | ||
| 9); | ||
| console.timeEnd(TEST); |