{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T14:35:29Z","timestamp":1781102129199,"version":"3.54.1"},"reference-count":24,"publisher":"IGI Global Scientific Publishing","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,1,1]]},"abstract":"<p>This paper proposes a contextual preference query method of XML structural relaxation and content scoring to resolve the problem of empty or too many answers returned by XML. This paper proposes a XML contextual preference (XCP) model, where all the possible relaxing queries are determined by the users\u2019 preferences. The XCP model allows users to express their interests on XML tree nodes, and then users assign interest scores to their interesting nodes for providing the best answers. A preference query results ranking method is proposed based on the XCP model, which includes: a Clusters_Merging algorithm to merge clusters based on the similarity of the context states, a Finding_Orders algorithm to find representative orders of the clusters, and a Top-k ranking algorithm to deal with the many answers problem. Results of preliminary user studies demonstrate that the method can provide users with most relevant and ranked query results. The efficiency and effectiveness of the approach are also demonstrated by experimental results.<\/p>","DOI":"10.4018\/jssoe.2011010102","type":"journal-article","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T12:51:37Z","timestamp":1319028697000},"page":"21-39","source":"Crossref","is-referenced-by-count":1,"title":["Automated Ranking of Relaxing Query Results Based on XML Structure and Content Preferences"],"prefix":"10.4018","volume":"2","author":[{"given":"Wei","family":"Yan","sequence":"first","affiliation":[{"name":"Northeastern University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Li","family":"Yan","sequence":"additional","affiliation":[{"name":"Northeastern University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Z. M.","family":"Ma","sequence":"additional","affiliation":[{"name":"Northeastern University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jssoe.2011010102-0","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Rantzau, R., & Terzi, E. (2006). Context-sensitive ranking. In Proceedings of the SIGMOD Conference on Management of Data (pp. 383-394).","DOI":"10.1145\/1142473.1142517"},{"key":"jssoe.2011010102-1","doi-asserted-by":"crossref","unstructured":"Amer-Yahia, S., Cho, S., & Srivastava, D. (2002). Tree pattern relaxation. In Proceedings of the EDBT Conference (pp. 496-513).","DOI":"10.1007\/3-540-45876-X_32"},{"key":"jssoe.2011010102-2","doi-asserted-by":"crossref","unstructured":"Amer-Yahia, S., Fundulaki, I., & Lakshmanan, L. (2007). Personalizing XML search in pimento. In Proceedings of the 23rd International Conference on Data Engineering (pp. 906-915).","DOI":"10.1109\/ICDE.2007.367936"},{"key":"jssoe.2011010102-3","unstructured":"Amer-Yahia, S., Koudas, N., Marian, A., Srivastava, D., & Toman, D. (2005). Structure and content scoring for XML. In Proceedings of the Conference on Very Large Data Bases (pp. 361-372)."},{"key":"jssoe.2011010102-4","doi-asserted-by":"crossref","unstructured":"Amer-Yahia, S., Lakshmanan, L., & Pandit, S. (2004). FleXPath: Flexible structure and full-text querying for XML. In Proceedings of the SIGMOD International Conference on Management of Data (pp. 83-94).","DOI":"10.1145\/1007568.1007581"},{"key":"jssoe.2011010102-5","doi-asserted-by":"crossref","unstructured":"Caneva, E., Oliboni, B., & Quintarelli, E. (2009). Mining flexible association rules from XML. In Proceedings of the DATAX Conference (pp. 85-92).","DOI":"10.1145\/1698790.1698805"},{"key":"jssoe.2011010102-6","doi-asserted-by":"crossref","unstructured":"Cho, S., & Balke, W. (2008). Order-preserving optimization of twig queries with structural preferences. In Proceedings of the International Symposium on Database Engineering and Applications (pp. 219-229).","DOI":"10.1145\/1451940.1451971"},{"key":"jssoe.2011010102-7","doi-asserted-by":"crossref","unstructured":"Cho, S., & Balke, W. (2009). Efficient evaluation of preference query processes using twig caches. In Proceedings of the RCIS Conference (pp. 365-374).","DOI":"10.1109\/RCIS.2009.5089300"},{"key":"jssoe.2011010102-8","doi-asserted-by":"crossref","unstructured":"Cho, S., & Balke, W. (2009). Relaxing XML preference queries for cooperative retrieval. In Proceedings of the 11th International ICEIS Conference (pp. 160-171).","DOI":"10.1007\/978-3-642-01347-8_14"},{"key":"jssoe.2011010102-9","doi-asserted-by":"publisher","DOI":"10.1145\/958942.958946"},{"key":"jssoe.2011010102-10","doi-asserted-by":"crossref","unstructured":"Fagin, R., Lotem, A., & Naor, M. (2001). Optimal aggregation algorithms for middleware. In Proceedings of the 20th SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (pp. 102-113).","DOI":"10.1145\/375551.375567"},{"key":"jssoe.2011010102-11","doi-asserted-by":"crossref","unstructured":"Hristidis, V., Koudas, N., & Papakonstantinou, Y. (2001). Prefer: A system for the efficient execution of multi-parametric ranked queries. In Proceedings of the SIGMOD International Conference on Management of Data (pp. 259-270).","DOI":"10.1145\/376284.375690"},{"key":"jssoe.2011010102-12","doi-asserted-by":"crossref","unstructured":"Koutrika, G., & Ioannidis, Y. (2005). Constrained optimalities in query personalization. In Proceedings of the SIGMOD International Conference on Management of Data (pp.73-84).","DOI":"10.1145\/1066157.1066167"},{"key":"jssoe.2011010102-13","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1209005"},{"key":"jssoe.2011010102-14","doi-asserted-by":"crossref","unstructured":"Liu, X., Wan, C., & Chen, L. (2009). Effective XML content and structure retrieval with relevance ranking. In Proceedings of the 18th ACM Conference on Information and Knowledge Management (pp. 147-156).","DOI":"10.1145\/1645953.1645974"},{"key":"jssoe.2011010102-15","unstructured":"Marian, A., Amer-Yahia, S., & Koudas, N. (2005). Divesh srivastava: Adaptive processing of Top-K queries in XML. In Proceedings of the 21st International Conference on Data Engineering (pp. 162-173)."},{"key":"jssoe.2011010102-16","doi-asserted-by":"crossref","unstructured":"Paik, J., Lee, J., Nam, J., & Kim, E. M. (2007) Mining maximally common substructures from XML trees with lists-based pattern-growth method. In Proceedings of the International Conference on Computational Intelligence and Security (pp. 209-213).","DOI":"10.1109\/CIS.2007.142"},{"key":"jssoe.2011010102-17","doi-asserted-by":"crossref","unstructured":"Paik, J., Nam, J., Kim, W. Y., Ryu, J. S., & Kim, U. M. (2009). Mining association rules in tree structured XML data. In Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human (pp. 807-811).","DOI":"10.1145\/1655925.1656072"},{"key":"jssoe.2011010102-18","doi-asserted-by":"crossref","unstructured":"Polyzotis, N., Garofalakis, M., & Ioannidis, Y. (2004). Approximate XML query answers. In Proceedings of the SIGMOD International Conference on Management of Data (pp. 263-274).","DOI":"10.1145\/1007568.1007599"},{"key":"jssoe.2011010102-19","unstructured":"Schlieder, T. (2001). Similarity search in XML data using cost-based query transformations. In Proceedings of the WebDB Conference (pp. 19-24)."},{"key":"jssoe.2011010102-20","doi-asserted-by":"crossref","unstructured":"Stefanidis, K., & Pitoura, E. (2008). Fast contextual preference scoring of database tuples. In Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology (pp. 344-355).","DOI":"10.1145\/1353343.1353387"},{"key":"jssoe.2011010102-21","doi-asserted-by":"crossref","unstructured":"Stefanidis, K., Pitoura, E., & Vassiliadis, P. (2007). Adding context to preferences. In Proceedings of the 23rd International Conference on Data Engineering (pp. 846-855).","DOI":"10.1109\/ICDE.2007.367930"},{"key":"jssoe.2011010102-22","doi-asserted-by":"crossref","unstructured":"Su, W., Wang, J., Huang, Q., & Lochovsky, F. (2006). Query result ranking over E-commerce web databases. In Proceedings of the 15th International Conference on Information and Knowledge Management (pp. 575-584).","DOI":"10.1145\/1183614.1183697"},{"key":"jssoe.2011010102-23","doi-asserted-by":"crossref","unstructured":"Vassiliadis, P., & Skiadopoulos, S. (2000). Modelling and optimisation issues for multidimensional database. In B. Wangler & L. Bergman (Eds.), Proceedings of the 12th International Conference on Advanced Information Systems Engineering (LNCS 1789, pp. 482-497).","DOI":"10.1007\/3-540-45140-4_32"}],"container-title":["International Journal of Systems and Service-Oriented Engineering"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=55060","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T21:35:52Z","timestamp":1654119352000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jssoe.2011010102"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2011,1,1]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"URL":"https:\/\/doi.org\/10.4018\/jssoe.2011010102","relation":{},"ISSN":["1947-3052","1947-3060"],"issn-type":[{"value":"1947-3052","type":"print"},{"value":"1947-3060","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,1]]}}}