Return specification inference and result clustering for keyword search on XML

ACM Transactions on Database Systems

Volumn 35, Issue 2, 2010, Pages

  Liu, Ziyang ^a   Chen, Yi ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

Keyword search; Result clustering; XML

Indexed keywords

COMPLEX DATA; DATA CENTRIC; EXPERIMENTAL STUDIES; KEYWORD SEARCH; OPEN PROBLEMS; QUERY RESULTS; SCHEMAS; STRUCTURED QUERY LANGUAGE; WEB USERS; XML DATA;

CLUSTER ANALYSIS; CONTENT BASED RETRIEVAL; DATA STRUCTURES; MARKUP LANGUAGES; QUERY LANGUAGES; SEARCH ENGINES; SEMANTICS; SPECIFICATIONS; XML;

WORLD WIDE WEB;

EID: 77952066916     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1735886.1735889     Document Type: Article

References (17)

1. AHUJA, R. K., MAGNANTI, T. L., AND ORLIN, J. B. 1993. Network Flows: Theory, Algorithms, and Applications, 1st ed. Prentice Hall.
2. BALINSKI, M. 1985. Signature methods for the assignment problem. Oper. Res. 33, 527-537.
3. BECKMANN, N., KRIEGEL, H.-P., SCHNEIDER, R., AND SEEGER, B. 1990. The R*-tree: An efficient and robust access method for points and rectangles. In Proceedings of the SIGMOD Conference. 322-331.
4. BERTSEKAS, D. P. 1981. A new algorithm for the assignment problem. Math. Program. 21, 1, 152-171.
5. BERTSEKAS, D. P. 1988. The auction algorithm: A distributed relaxation method for the assignment problem. Ann. Oper. Res. 14, 1-4, 105-123.
6. BIALLY, T. 1969. Space-Filling curves: Their generation and their application to bandwidth reduction. IEEE Trans. Inf. Theory 15, 6, 658-664.
7. BRINKHOFF, T. 2002. A framework for generating network-based moving objects. GeoInf. 6, 2, 153-180.
8. CORRAL, A.,MANOLOPOULOS, Y.,THEODORIDIS, Y., AND VASSILAKOPOULOS,M. 2000. Closest pair queries in spatial databases. In Proceedings of the SIGMOD Conference. 189-200.
9. DERIGS, U. 1981. A shortest augmenting path method for solving minimal perfect matching problems. Netw. 11, 4, 379-390.
10. ESTER, M., KRIEGEL, H.-P., AND XU, X. 1995. Knowledge discovery in large spatial databases: Focusing techniques for efficient class identification. In Proceedings of the International Symposium on Advances in Spatial Databases (SSD). 67-82.
11. GABOW, H. N. AND TARJAN, R. E. 1991. Faster scaling algorithms for general graph-matching problems. J. ACM 38, 4, 815-853.
12. GALE, D. AND SHAPLEY, L. S. 1962. College admissions and the stability of marriage. Amer. Math. Monthly 69, 1, 9-15.
13. GOLDBERG, A. V. AND KENNEDY, R. 1995. An efficient cost scaling algorithm for the assignment problem. Math. Program. 71, 153-177.
14. GUSFIELD, D. AND IRVING, R. W. 1989. The Stable Marriage Problem: Structure and Algorithms. MIT Press.
15. GUTTMAN, A. 1984. R-Trees: A dynamic index structure for spatial searching. In Proceeding of the SIGMOD Conference. 47-57.
16. HJALTASON, G. R. AND SAMET, H. 1999. Distance browsing in spatial databases. ACMTrans. Datab. Syst. 24, 2, 265-318.
17. HUNG, M. 1983. A polynomial simplex method for the assignment problem. Opera. Res. 31, 595-600.