Flexible XML querying using skyline semantics

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2009, Pages 553-564

  Cohen, Sara ^a   Shiloach, Maayan ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

FLEXIBLE QUERYING; OPTIMAL RESULTS; QUERY EVALUATION; RELATIONAL DATA; RELATIONAL DATABASE; SCORING FUNCTIONS; SKYLINE QUERYING; VALUE-BASED; XML DATA; XML QUERIES; XML QUERYING;

LINGUISTICS; MARKUP LANGUAGES; QUERY LANGUAGES; SEMANTICS;

XML;

EID: 67649651676     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2009.24     Document Type: Conference Paper

References (22)

1. J. Chomicki, P. Godfrey, J. Gryz, and D. Liang, "Skyline with presorting: Theory and optimizations," in Intelligent Information Systems, 2005, pp. 595-604.
2. P. Godfrey, R. Shipley, and J. Gryz, "Algorithms and analyses for maximal vector computation," VLDB J., vol. 16, no. 1, pp. 5-28, 2007.
3. K.-L. Tan, P.-K. Eng, and B. C. Ooi, "Efficient progressive skyline computation," in VLDB, 2001, pp. 301-310.
4. M. D. Morse, J. M. Patel, and H. V. Jagadish, "Efficient skyline computation over low-cardinality domains," in VLDB, 2007, pp. 267-278.
5. D. Kossmann, F. Ramsak, and S. Rost, "Shooting stars in the sky: An online algorithm for skyline queries," in VLDB, 2002, pp. 275-286.
6. S. Börzsönyi, D. Kossmann, and K. Stocker, "The skyline operator," in ICDE, 2001, pp. 421-430.
7. S. Amer-Yahia, L. V. S. Lakshmanan, and S. Pandit, "Flexpath: Flexible structure and full-text querying for xml," in SIGMOD, 2004, pp. 83-94.
8. S. Amer-Yahia, S. Cho, and D. Srivastava, "Tree pattern relaxation," in EDBT, 2002, pp. 496-513.
9. B. Kimelfeld and Y. Sagiv, "Combining incompleteness and ranking in tree queries," in ICDT, 2007, pp. 329-343.
10. Y. Kanza and Y. Sagiv, "Flexible queries over semistructured data," in PODS, 2001.
11. Y. Kanza, W. Nutt, and Y. Sagiv, "Querying incomplete information in semistructured data," J. Comput. Syst. Sci., vol. 64, no. 3, pp. 655-693, 2002.
12. T. Brodianskiy and S. Cohen, "Self-correcting queries for xml," in CIKM, 2007, pp. 11-20.
13. Y. Wu, J. M. Patel, and H. V. Jagadish, "Using histograms to estimate answer sizes for xml queries," Inf. Syst., vol. 28, no. 1-2, pp. 33-59, 2003.
14. N. Zhang, P. J. Haas, V. Josifovski, G. M. Lohman, and C. Zhang, "Statistical learning techniques for costing xml queries," in VLDB, 2005, pp. 289-300.
15. C. Luo, Z. Jiang, W.-C. Hou, F. Yan, and C.-F. Wang, "Estimating xml structural join size quickly and economically," in ICDE, 2006.
16. N. Zhang, M. T. Özsu, A. Aboulnaga, and I. F. Ilyas, "Xseed: Accurate and fast cardinality estimation for xpath queries," in ICDE, 2006.
17. L. V. S. Lakshmanan, G. Ramesh, H. Wang, and Z. J. Zhao, "On testing satisfiability of tree pattern queries," in VLDB, 2004, pp. 120-131.
18. S. Cohen, Y. Kanza, B. Kimelfeld, and Y. Sagiv, "Interconnection semantics for keyword search in xml," in CIKM, 2005, pp. 389-396.
19. R. Goldman and J. Widom, "Dataguides: Enabling query formulation and optimization in semistructured databases," in VLDB, 1997, pp. 436-445.
20. T. Milo and D. Suciu, "Index structures for path expressions," in ICDT, 1999, pp. 277-295.
21. R. Kaushik, P. Bohannon, J. F. Naughton, and H. F. Korth, "Covering indexes for branching path queries," in SIGMOD, 2002, pp. 133-144.
22. A. Schmidt, F. Waas, M. L. Kersten, M. J. Carey, I. Manolescu, and R. Busse, "Xmark: A benchmark for xml data management," in VLDB, 2002, pp. 974-985.