Weighted path queries on semistructured databases

Information and Computation

Volumn 204, Issue 5, 2006, Pages 679-696

  Flesca, Sergio ^a   Furfaro, Filippo ^a   Greco, Sergio ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Path queries; Query languages; Semistructured data

Indexed keywords

OPTIMIZATION; PATTERN MATCHING; QUERY LANGUAGES; XML;

OPTIMIZATION PROBLEMS; PATH QUERIES; REGULAR EXPRESSIONS; RESEARCH PROBLEMS; SEMI STRUCTURED DATA; SEMISTRUCTURED DATABASE; SHORTEST PATH; XML DATA;

QUERY PROCESSING;

EID: 84855206535     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2005.12.002     Document Type: Article

References (28)

1. S. Abiteboul, Queryingsemi-structured data, in: Proceedings of the International Conference on Database Theory (ICDT), 1997, pp. 1-18.
2. S. Abiteboul, P. Bunemann, D. Suciu, Data on the Web, Morgan-Kaufmann, 2000.
3. S. Abiteboul, V. Vianu, Queries and Computation on the Web, in: Proceedings of the International Conference on Database Theory, 1997, pp. 262-275. (Pubitemid 127013758)
4. C. Beeri, Y. Kornatzky, A logical query language for hypertext systems, in: Proceedings of the European Conference on Hypertexts, 1990, pp. 67-80.
5. A. L. Buchsbaum, R. Giancarlo, J. R. Westbrook, On the determinization of weighted finite automata, in: Proceedings of the International Colloquium on Automata Languages and Programming (ICALP), 1998, pp. 482-493. (Pubitemid 128111139)
6. V. Christophides, S. Cluet, G. Moerkotte, Evaluating queries with generalized path expressions, in: Proceedings of the ACM-SIGMOD International Conference on Management of Data (SIGMOD), 1996, pp. 413-422. (Pubitemid 126440787)
7. T. H. Cormen, C. E. Leiserson, R. L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, 1990.
8. +: recursive queries without recursion, in: Proceedings of Second International Conference on Expert Database Systems, 1988, pp. 355-368.
9. K. Culik II, J. Karhumki, Finite automata computingreal functions, SIAM J. Comput. 23(4) (1994) 789-814.
10. S. Flesca, S. Greco, Partially ordered regular languages for graph queries, in: Proceedings of the International Colloquium on Automata Languages and Programming (ICALP), 1999, pp. 321-330.
11. S. Flesca, S. Greco, Querying graphdatabases, in: Proceedings of the International Conference on Extending Database Technology (EDBT), 2000, pp. 510-524.
12. F. Furfaro, S. Flesca, S. Greco, Weighted path queries on semistructured databases, in: Proceedings of the International Workshop on the Web and Databases (WebDB), 2001.
13. J. Hopcroft, R. Motwani, J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 2001.
14. M. Kifer, W. Kim, Y. Sagiv, Querying object-oriented databases, in: Proceedings of the ACM-SIGMOD International Conference on Management of Data (SIGMOD), 1992 pp. 393-402.
15. A. Mendelzon, P. T. Wood, Finding regular simple pathsingraph databases, SIAM J. Comput. 24(6) (1995) 1235-1258.
16. A. Mendelzon, G. Mihaila, T. Milo, Queryingthe World Wide Web, J. Digital Libraries (1997).
17. A. Mendelzon, T. Milo, Formal models of web queries, in: Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), 1997, pp. 134-143.
18. T. Minohara, R. Watanabe, M. Tokoro, Queries on Structures in Hypertext, in: Proceedings of the Fourth International Conference on Foundations of Data Organization and Algorithms (FODO), 1993, pp. 394-411.
19. M. Mohri, Semiring Frameworks and Algorithms for Shortest-Distance Problems, J. Automata Lang. Combinatorics 7(3) (2002) 321-350.
20. F. C. N. Pereira, M. Riley, Speech recognition by composition of weighted finite automata, in: E. Roche, Y. Schabes (Eds.), Finite-State Language Processing, MIT Press, Cambridge, 1997.
21. A. Salomaa, Probabilistic and Weighted Grammars, Informat. Control 15(6) (1969) 529-544.
22. A. Salomaa, W. Kuich, Semirings, automata, languages, in: EATCS Monographs on Theoretical Computer Science, vol. 5, Springer-Verlag, Berlin and New York, 1986.
23. W. G. Tzeng, The Equivalence and Learning of Probabilistic Automata, in: International Conference on Foundation of Computer Science (FOCS), 1989, pp. 268-273..
24. W. G. Tzeng, A polynomial-time algorithm for the equivalence of probabilistic automata, SIAM J. Comput. 21(2) (1992) 216-227.
25. J. Van den Bussche, G. Vossen, An extension of path expressions to simplify navigation in object-oriented queries, in: Conference on Deductive and Object-Oriented Databases, 1993, pp. 267-282.
26. XML Path Language, http://www.w3.org/TR/xpath.
27. XML Query, http://www.w3.org/XML/Query.
28. XSL Transformations, http://www.w3.org/TR/xslt.