Difference between revisions of "CRPQ"
| 2020244055 (talk | contribs)  (→早期论文) | 2020244055 (talk | contribs)   (→经典论文) | ||
| Line 1: | Line 1: | ||
| == 经典论文 == | == 经典论文 == | ||
| # Mendelzon A O, Wood P T. Finding regular simple paths in graph databases[J]. SIAM Journal on Computing, 1995, 24(6): 1235-1258. [https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.96.9492&rep=rep1&type=pdf] | # Mendelzon A O, Wood P T. Finding regular simple paths in graph databases[J]. SIAM Journal on Computing, 1995, 24(6): 1235-1258. [https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.96.9492&rep=rep1&type=pdf] | ||
| + | # Isabel F. Cruz, Alberto O. Mendelzon, Peter T. Wood: G+: Recursive Queries Without Recursion. Expert Database Conf. 1988: 645-666 [https://dblp.org/db/conf/eds/eds88.html#CruzMW88] | ||
| + | # Cruz I F, Mendelzon A O, Wood P T. A graphical query language supporting recursion[J]. ACM SIGMOD Record, 1987, 16(3): 323-330. [https://dl.acm.org/doi/abs/10.1145/38714.38749?casa_token=YjRGjPP3oSsAAAAA:j_UgeWBy0fbnssow1haatx1j1ijvendVHguQJUch7Nlia_snX1ox3Tb03TUiMK-ujzxp_2iPVK48] | ||
Revision as of 03:22, 19 December 2021
经典论文
- Mendelzon A O, Wood P T. Finding regular simple paths in graph databases[J]. SIAM Journal on Computing, 1995, 24(6): 1235-1258. [1]
- Isabel F. Cruz, Alberto O. Mendelzon, Peter T. Wood: G+: Recursive Queries Without Recursion. Expert Database Conf. 1988: 645-666 [2]
- Cruz I F, Mendelzon A O, Wood P T. A graphical query language supporting recursion[J]. ACM SIGMOD Record, 1987, 16(3): 323-330. [3]
