Abstract
We consider the problem of discovering candidate ID and IDREF attributes in a schemaless XML document. We characterize the complexity of the problem, propose a heuristic algorithm for it, and discuss experimental results.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web. Morgan Kaufmann, San Francisco (1999)
Arenas, M., Fan, W., Libkin, L.: On verifying consistency of XML specifications. In: Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp. 259–270 (2002)
Buneman, P., Davidson, S., Fan, W., Hara, C., Tan, W.-C.: Keys for XML. In: Proceedings of the 10th International Conference on the World Wide Web, pp. 201–210. ACM Press, New York (2001)
Garey, M., Johnson, D.: Computers and Intractability: a Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
Garofalakis, M.N., Gionis, A., Rastogi, R., Seshadri, S., Shim, K.: XTRACT: A system for extracting document type descriptors from XML documents. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, Dallas, Texas, USA, May 16-18, pp. 165–176 (2000)
Grahne, G., Zhu, J.: Discovering approximate keys in XML data. In: Press, A. (ed.) Proceedings of the 11th international conference on Information and knowledge management, McLean, Virginia, USA, November 4-9, pp. 453–460 (2002)
Mannila, H., Räihä, K.-J.: On the complexity of inferring functional dependencies. Discrete Applied Mathematics 40(2), 237–243 (1992)
Mignet, L., Barbosa, D., Veltri, P.: The XML Web: a first study. In: Proceedings of The 12th International World Wide Web Conference (2003) (to appear)
Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1995)
Paschos, V.T.: A survey of approximately optimal solutions to some covering and packing problems. ACM Computing Surveys 29(2), 171–209 (1997)
Schmidt, A.R., Waas, F., Kersten, M.L., Carey, M.J., Manolescu, I., Busse, R.: XMark: A Benchmark for XML Data Management. In: Proceedings of the International Conference on Very Large Data Bases (VLDB), Hong Kong, China, August 2002, pp. 974–985 (2002)
Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2003)
Extensible markup language (XML) 1.0 - 2nd edition. W3C Recommendation, October 6 (2000), available at: http://www.w3.org/TR/2000/REC-xml-20001006
XML Schema part 1: Structures. W3C Recommendation, May 2 (2001), available at: http://www.w3.org/TR/xmlschema-1/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barbosa, D., Mendelzon, A. (2003). Finding ID Attributes in XML Documents. In: Bellahsène, Z., Chaudhri, A.B., Rahm, E., Rys, M., Unland, R. (eds) Database and XML Technologies. XSym 2003. Lecture Notes in Computer Science, vol 2824. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39429-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-39429-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20055-0
Online ISBN: 978-3-540-39429-7
eBook Packages: Springer Book Archive