{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:33:35Z","timestamp":1750307615132,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,10,30]],"date-time":"2008-10-30T00:00:00Z","timestamp":1225324800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,10,30]]},"DOI":"10.1145\/1458502.1458506","type":"proceedings-article","created":{"date-parts":[[2008,11,11]],"date-time":"2008-11-11T12:59:40Z","timestamp":1226408380000},"page":"17-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["PIXSAR"],"prefix":"10.1145","author":[{"given":"Lila","family":"Shnaiderman","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oded","family":"Shmueli","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajesh","family":"Bordawekar","sequence":"additional","affiliation":[{"name":"IBM T. J. Watson Research Center, Hawthorne, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,10,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066197"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30081-6_15"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.04.010"},{"key":"e_1_3_2_1_4_1","volume-title":"IBM Research","author":"Bordawekar R.","year":"2006","unstructured":"R. Bordawekar and O. Shmueli . An Algorithm for Partitioning Trees Augmented with Sibling Edges. Technical report , IBM Research , June 2006 . R. Bordawekar and O. Shmueli. An Algorithm for Partitioning Trees Augmented with Sibling Edges. Technical report, IBM Research, June 2006."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/115790.115793"},{"key":"e_1_3_2_1_7_1","volume-title":"Storing and querying xml data using an rdbms","author":"Florescu D.","year":"1999","unstructured":"D. Florescu and D. Kossmann . Storing and querying xml data using an rdbms . IEEE Data Engineering Bulletin , 1999 . D. Florescu and D. Kossmann. Storing and querying xml data using an rdbms. IEEE Data Engineering Bulletin, 1999."},{"key":"e_1_3_2_1_8_1","volume-title":"Computers and Intractability","author":"Garey M. S.","year":"1979","unstructured":"M. S. Garey and D. S. Johnson . Computers and Intractability . W. H. Freeman and Co. , 1979 . M. S. Garey and D. S. Johnson. Computers and Intractability. W. H. Freeman and Co., 1979."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/645415.652043"},{"key":"e_1_3_2_1_10_1","volume-title":"Deriving program physical structures using bond energy algorithm. apsec","author":"Gorla N.","year":"1999","unstructured":"N. Gorla and K. Zhang . Deriving program physical structures using bond energy algorithm. apsec , 1999 . N. Gorla and K. Zhang. Deriving program physical structures using bond energy algorithm. apsec, 1999."},{"key":"e_1_3_2_1_11_1","volume-title":"On knapsacks, partitions, and a new dynamic programming technique for trees. Mathematics of Operations Research, 8(1)","author":"Johnson D. S.","year":"1983","unstructured":"D. S. Johnson and K. A. Niemi . On knapsacks, partitions, and a new dynamic programming technique for trees. Mathematics of Operations Research, 8(1) , 1983 . D. S. Johnson and K. A. Niemi. On knapsacks, partitions, and a new dynamic programming technique for trees. Mathematics of Operations Research, 8(1), 1983."},{"key":"e_1_3_2_1_12_1","volume-title":"Operations Research","author":"Schweitzer W. T. M. Jr., P. J.","year":"1997","unstructured":"W. T. M. Jr., P. J. Schweitzer , and T. W. White . Problem Decomposition and Data Reorganization by a Clustering Technique . Operations Research , 1997 . W. T. M. Jr., P. J. Schweitzer, and T. W. White. Problem Decomposition and Data Reorganization by a Clustering Technique. Operations Research, 1997."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2000.839412"},{"key":"e_1_3_2_1_14_1","volume-title":"VLDB","author":"Kanne C.-C.","year":"2006","unstructured":"C.-C. Kanne and G. Moerkotte . A linear time algorithm for optimal tree sibling partitioning and approximation algorithms in natix . In VLDB , 2006 . C.-C. Kanne and G. Moerkotte. A linear time algorithm for optimal tree sibling partitioning and approximation algorithms in natix. In VLDB, 2006."},{"key":"e_1_3_2_1_15_1","unstructured":"M. Kay. SAXON: XSLT and XQuery Engine. www.saxonica.com.  M. Kay. SAXON: XSLT and XQuery Engine. www.saxonica.com."},{"key":"e_1_3_2_1_16_1","author":"Kernighan B. W.","year":"1971","unstructured":"B. W. Kernighan . Optimal sequential partitions of graphs. J. Assoc. Comp. Mach. , 1971 . B. W. Kernighan. Optimal sequential partitions of graphs. J. Assoc. Comp. Mach., 1971.","journal-title":"J. Assoc. Comp. Mach."},{"key":"e_1_3_2_1_17_1","author":"Kernighan B. W.","year":"1970","unstructured":"B. W. Kernighan and S. Lin . An efficient heuristic procedure for partitioning graphs. Bell Sys. Tech. J. , 1970 . B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell Sys. Tech. J., 1970.","journal-title":"An efficient heuristic procedure for partitioning graphs. Bell Sys. Tech. J."},{"key":"e_1_3_2_1_18_1","volume-title":"A linear tree partitioning algorithm","author":"Kundu S.","year":"1977","unstructured":"S. Kundu and J. Misra . A linear tree partitioning algorithm . SIAM , 1977 . S. Kundu and J. Misra. A linear tree partitioning algorithm. SIAM, 1977."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.183.0217"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/286936.377403"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/320521.320531"},{"key":"e_1_3_2_1_22_1","volume-title":"VLDB","author":"Schmidt A. R.","year":"2002","unstructured":"A. R. Schmidt , F. Waas , M. L. Kersten , M. J. Carey , I. Manolescu , and R. Busse . XMark: A Benchmark for XML Data Management . In VLDB , 2002 . A. R. Schmidt, F. Waas, M. L. Kersten, M. J. Carey, I. Manolescu, and R. Busse. XMark: A Benchmark for XML Data Management. In VLDB, 2002."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/645339.650152"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/130283.130308"},{"key":"e_1_3_2_1_25_1","unstructured":"W3C. XML: Extensible Markup Language. http:\/\/www.w3.org\/XML\/.  W3C. XML: Extensible Markup Language. http:\/\/www.w3.org\/XML\/."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/977401.978103"}],"event":{"name":"CIKM08: Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","ACM Association for Computing Machinery","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Napa Valley California USA","acronym":"CIKM08"},"container-title":["Proceedings of the 10th ACM workshop on Web information and data management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1458502.1458506","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1458502.1458506","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:45:44Z","timestamp":1750250744000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1458502.1458506"}},"subtitle":["incremental reclustering of augmented XML trees"],"short-title":[],"issued":{"date-parts":[[2008,10,30]]},"references-count":25,"alternative-id":["10.1145\/1458502.1458506","10.1145\/1458502"],"URL":"https:\/\/doi.org\/10.1145\/1458502.1458506","relation":{},"subject":[],"published":{"date-parts":[[2008,10,30]]},"assertion":[{"value":"2008-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}