{"entities":{"Q5268328":{"pageid":7297904,"ns":120,"title":"Item:Q5268328","lastrevid":91989617,"modified":"2026-06-05T00:35:10Z","type":"item","id":"Q5268328","labels":{"en":{"language":"en","value":"On Adding Bloom Filters to Longest Prefix Matching Algorithms"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6733247"}},"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":"Q5268328$838987EF-D76C-4584-9CAF-641DECCC80BA","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"56d5f7d39ff2b117371ba8f21815a5ca66685841","datavalue":{"value":{"text":"On Adding Bloom Filters to Longest Prefix Matching Algorithms","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5268328$D182B649-F1D6-48ED-86C8-0C84893FCB74","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"855287a708968a7df129ef68626c350f96eff724","datavalue":{"value":"1364.94138","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5268328$217F6ACA-5064-4596-A6CC-E13BF7550F3B","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"fba3fb280819427da9ad0cbc4e56b7c9848fc1f9","datavalue":{"value":"10.1109/TC.2012.193","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5268328$F343F731-AE23-4FF5-B318-DAA3583185BF","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"87c7be45b59275f99e94ba83f0e03d9fbcbc2893","datavalue":{"value":{"entity-type":"item","numeric-id":2985480,"id":"Q2985480"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5268328$6F983F8A-ECEF-4C0B-A1EE-B838BC71A6F2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"256c89f52eb6a5655ecfde092d8f47691288af18","datavalue":{"value":{"entity-type":"item","numeric-id":5268325,"id":"Q5268325"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5268328$38ABB762-3FFC-45B0-80DF-89612EA2F27E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"34e62a7a131dd0950edc0afa227651cbc1a26856","datavalue":{"value":{"entity-type":"item","numeric-id":5268326,"id":"Q5268326"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5268328$FF0166AD-8632-4657-B715-AF0D7088BCB9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"14e9ed0afc82aaa1420f46fdf02e473e66e7f84c","datavalue":{"value":{"entity-type":"item","numeric-id":5268327,"id":"Q5268327"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5268328$65E33768-DA6F-4734-B597-95463F7D4B35","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"cb95ba1181f89055fe808aa2c36bea9d3930d0fc","datavalue":{"value":{"entity-type":"item","numeric-id":80442,"id":"Q80442"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5268328$8FD82898-FB11-4F9F-BE72-F1838F7F03E7","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"45ab5f4056988d923c86758a1a35479e5313b50c","datavalue":{"value":{"time":"+2017-06-20T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5268328$793090C2-56A2-4666-9514-61B6C6602607","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"4db3fc3244f368e49336c7e23443d11b7d69297d","datavalue":{"value":"94A12","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5268328$F17B7FFF-66E4-4CEF-922E-50644FA69299","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"14cf74de25853c940589b125137b792dfb2d092b","datavalue":{"value":"68P05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5268328$AA162FAF-E76D-4169-8C5C-A98433313418","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"c1dc6703403f35f6438a0b89e39e3178a4851ba7","datavalue":{"value":"6733247","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5268328$C9B14800-AC6E-47FE-9D41-89821E182C68","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":"Q5268328$2252B47A-2DD3-41FF-8935-F0D6581FA941","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On Adding Bloom Filters to Longest Prefix Matching Algorithms","badges":[]}}}}}