{"entities":{"Q4054665":{"pageid":6084334,"ns":120,"title":"Item:Q4054665","lastrevid":93087779,"modified":"2026-06-05T03:36:44Z","type":"item","id":"Q4054665","labels":{"en":{"language":"en","value":"A cost oriented algorithm for data set allocation in storage hierarchies"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3470013"}},"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":"Q4054665$B6F34125-806D-43E8-B1AB-8A4DA4BC70ED","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"cec80c3b064dce1ffb13f9bc8ebb9c927c16de35","datavalue":{"value":{"text":"A cost oriented algorithm for data set allocation in storage hierarchies","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q4054665$854AF6EA-3067-46EA-B91F-AD7624217EAC","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"5e3b278ed1a21169f569365d5060d0f73510e615","datavalue":{"value":"0299.68026","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4054665$C44FDA58-FAFE-4EB0-95A4-6D5A929473F2","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"ad813c2b4624e9e568c76a992499db26585c3f71","datavalue":{"value":"10.1145/360825.360843","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4054665$B969011F-0193-418E-B6C0-D0235CFA84AC","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b5e8f5a4bedcdf1368f667e537d4925490c864ae","datavalue":{"value":{"time":"+1975-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q4054665$F71C93D8-7BA0-4ED7-A064-0EB2768D22C7","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"b8e3f40e3cc87753c4e0b7d7ce4bdc00805f626f","datavalue":{"value":"68N01","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4054665$5AF22C1F-9B74-4CC7-A818-EFC6A9E9C2DD","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"6573e4e96345ebb50058644c98cab59a9874faf8","datavalue":{"value":"3470013","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4054665$BA2B61AD-B37C-4031-A449-762E9F8CDB97","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":"Q4054665$7CB5B20F-8564-4310-8AEA-1645F911B43C","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"46be5857206767d10bc5270f83c30a07454c2abf","datavalue":{"value":"https://doi.org/10.1145/360825.360843","type":"string"},"datatype":"url"},"type":"statement","id":"Q4054665$AF54D89C-7AF1-4591-B9E5-70ED615BC553","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"a5154a5d2417a6117ef24ac099e2c23f0213b080","datavalue":{"value":"W2014796038","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4054665$D93EF882-E5D7-4EDF-95DD-36E8C880FAF5","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"087426e75e65ba42be09a15851f31de13b7aa5f3","datavalue":{"value":{"entity-type":"item","numeric-id":56730,"id":"Q56730"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4054665$361BFB05-4413-484A-A3A1-58415D107F09","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A cost oriented algorithm for data set allocation in storage hierarchies","badges":[]}}}}}