{"entities":{"Q6909505":{"pageid":20958895,"ns":120,"title":"Item:Q6909505","lastrevid":75610225,"modified":"2026-04-20T08:57:02Z","type":"item","id":"Q6909505","labels":{"en":{"language":"en","value":"Overcoming the memory bottleneck in suffix tree construction"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8112170"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6909505$DF238B47-082B-4D38-B8AC-FF6B8DCA93BE","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"8351144db0ff770cdfd3ee15245e414380045316","datavalue":{"value":{"text":"Overcoming the memory bottleneck in suffix tree construction","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6909505$013CB331-C8EE-4342-8F0F-E10AD93E7217","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"f4f00d07d8c547c8efc4496eefd1f2e0f2558653","datavalue":{"value":"10.1109/SFCS.1998.743441","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6909505$33EFB78E-FC38-4F2E-AA1E-D9969270CB80","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"cc55add5ed8041a8846ff1986f4a74d34fea4ea3","datavalue":{"value":{"entity-type":"item","numeric-id":6486944,"id":"Q6486944"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6909505$D35B330C-E45B-49BA-B2EE-2ACEC1425609","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5aeb384fd0cacd0ac1304d14ec513cc367a2af10","datavalue":{"value":{"entity-type":"item","numeric-id":811133,"id":"Q811133"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6909505$6E5BE81B-A33F-4C8F-9F3E-294593449EED","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"00267c69bd4ded11f833cbf74f0776dd0137bacc","datavalue":{"value":{"entity-type":"item","numeric-id":205199,"id":"Q205199"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6909505$175AA138-2DE2-44F1-9C64-443A318FDD41","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b77d6a4382bc7a32fc14d82772e7dcb343e03ac6","datavalue":{"value":{"time":"+2025-10-29T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6909505$2A50A3F5-588E-443D-A472-4FDBC3106163","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6909505$895079E6-27C8-4018-99B0-D522D1F75512","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"2c5bac012a1e63b3d1a4acafb0cee38bf4d8ef53","datavalue":{"value":"8112170","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6909505$5F804696-54A9-4E92-A690-DBC342B3FF7E","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6909505$D6B0AF43-AA7A-4101-BB42-DDF6703DE9DC","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Overcoming the memory bottleneck in suffix tree construction","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Overcoming_the_memory_bottleneck_in_suffix_tree_construction"}}}}}