{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,17]],"date-time":"2026-10-17T19:41:42Z","timestamp":1792266102945,"version":"4.4.0"},"reference-count":0,"publisher":"Walter de Gruyter GmbH","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,2,28]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>In an increasing number of use cases, databases face the challenge of\nmanaging heterogeneous data. Heterogeneous data is characterized by\na\u00a0quickly evolving variety of entities without a\u00a0common set of\nattributes. These entities do not show enough regularity to be\ncaptured in a\u00a0traditional database schema. A\u00a0common solution is to\ncentralize the diverse entities in a\u00a0universal table.  Usually, this\nleads to a\u00a0very sparse table. Although today's techniques allow\nefficient storage of sparse universal tables, query efficiency is\nstill a\u00a0problem. Queries that address only a\u00a0subset of attributes\nhave to read the whole universal table including many irrelevant\nentities. A\u00a0solution is to use a\u00a0partitioning of the table, which\nallows pruning partitions of irrelevant entities before they are\ntouched. Creating and maintaining such a\u00a0partitioning manually is\nvery laborious or even infeasible, due to the enormous\ncomplexity. Thus an autonomous solution is desirable.<\/jats:p>\n               <jats:p>In this article, we define the Online Partitioning Problem for\nheterogeneous data.  We sketch how an optimal solution for this\nproblem can be determined based on hypergraph partitioning. Although\nit leads to the optimal partitioning, the hypergraph approach is\ninappropriate for an implementation in a\u00a0database system. We present\nCinderella, an autonomous online algorithm for horizontal partitioning\nof heterogeneous entities in universal tables. Cinderella is designed\nto keep its overhead low by operating online; it incrementally assigns\nentities to partition while they are touched anyway during\nmodifications. This enables a\u00a0reasonable physical database design at\nruntime instead of static modeling.<\/jats:p>","DOI":"10.1515\/itit-2014-1015","type":"journal-article","created":{"date-parts":[[2014,2,5]],"date-time":"2014-02-05T20:18:02Z","timestamp":1391631482000},"page":"4-12","source":"Crossref","is-referenced-by-count":5,"title":["Online horizontal partitioning of heterogeneous data"],"prefix":"10.1515","volume":"56","author":[{"given":"Kai","family":"Herrmann","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t Dresden, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hannes","family":"Voigt","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Dresden, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wolfgang","family":"Lehner","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Dresden, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"374","published-online":{"date-parts":[[2014,1,31]]},"container-title":["it \u2013 Information Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/itit-2014-1015\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/itit-2014-1015\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,23]],"date-time":"2021-06-23T11:41:47Z","timestamp":1624448507000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/itit-2014-1015\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,31]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2014,1,31]]},"published-print":{"date-parts":[[2014,2,28]]}},"alternative-id":["10.1515\/itit-2014-1015"],"URL":"https:\/\/doi.org\/10.1515\/itit-2014-1015","relation":{},"ISSN":["2196-7032","1611-2776"],"issn-type":[{"value":"2196-7032","type":"electronic"},{"value":"1611-2776","type":"print"}],"subject":[],"published":{"date-parts":[[2014,1,31]]}}}