{"entities":{"Q3883479":{"pageid":5913384,"ns":120,"title":"Item:Q3883479","lastrevid":90844025,"modified":"2026-06-04T21:32:42Z","type":"item","id":"Q3883479","labels":{"en":{"language":"en","value":"Optimal and Near-Optimal Scheduling Algorithms for Batched Processing in Linear Storage"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3688698"}},"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":"Q3883479$8E2EBB7D-0CEB-4C88-AD75-FCDA2B2F8C45","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"2b1e5aee0460d3f4ce5ed5545a757a00862d37e0","datavalue":{"value":{"text":"Optimal and Near-Optimal Scheduling Algorithms for Batched Processing in Linear Storage","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q3883479$79216E46-694A-49E1-91D0-D1D936CBC8D6","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"67dbd847547c46743ed9bf31c46fc279f2b72b51","datavalue":{"value":"0441.68030","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3883479$C2C59062-777A-494E-B66E-5E8AB23B0040","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"501f60bd0e2b953698b7b44195f96e92cf993699","datavalue":{"value":"10.1137/0208039","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3883479$FAC9ADA2-470D-4F95-A360-CFBE442938B4","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"c2a1c45d0f0997786c62faf9f7fcd603424632e8","datavalue":{"value":{"entity-type":"item","numeric-id":84798,"id":"Q84798"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3883479$AF28B05E-4439-4496-90CA-5AA1481EBF0C","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"0b87f78dda5694898cc127305eecf88680ce6c83","datavalue":{"value":{"time":"+1979-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":"Q3883479$A6A26504-4350-4A18-81C4-482C9523C9BB","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1908801a2431998085c7d582418a428f7e7f6658","datavalue":{"value":"68M20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3883479$65447262-0F2B-444B-8CFD-EB4DAB405729","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"4ac111dd80122b5ffb08a02f1d2aef43a748c1af","datavalue":{"value":"3688698","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3883479$48857606-8D78-42AA-8B2D-F244C3083F4B","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"db79fe803f33567ba7d2dfbe4ca85aa16273d9c9","datavalue":{"value":"batched processing","type":"string"},"datatype":"string"},"type":"statement","id":"Q3883479$1BF81A0D-2DE1-4BB0-8008-770AE698680A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"81224d14f46b77d013e1161abe8ac1f93612f175","datavalue":{"value":"minimizing expected access time","type":"string"},"datatype":"string"},"type":"statement","id":"Q3883479$8972D06A-CE28-4B6C-BAD8-6758AC712078","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d2363f9cd1131fe8fc3dc0501d5e4d79130401ee","datavalue":{"value":"linear storage medium","type":"string"},"datatype":"string"},"type":"statement","id":"Q3883479$A2578E10-76F7-4691-BE1C-72016FD935EF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"79a3cae9844a67d90da57ecab3046c688142a513","datavalue":{"value":"scheduling algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q3883479$24BB1355-3501-424E-871C-D3333C5ABA56","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":"Q3883479$2F3708E8-3B33-4686-B7E4-E96ECE0CE123","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"34fb42a7eca8a009d75109f7b7b62d91b6dd7451","datavalue":{"value":"https://doi.org/10.1137/0208039","type":"string"},"datatype":"url"},"type":"statement","id":"Q3883479$8BE08C32-7DAC-407F-BD28-3BAEE1758D3E","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"3dfb980a2a09caa0c7571fc97a7a4cc97b2636bc","datavalue":{"value":"W1990301739","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3883479$F3150440-CDE1-454F-9CB7-B9B9F9E94291","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Optimal and Near-Optimal Scheduling Algorithms for Batched Processing in Linear Storage","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Optimal_and_Near-Optimal_Scheduling_Algorithms_for_Batched_Processing_in_Linear_Storage"}}}}}