-
1
-
-
1142303692
-
D(k)-index: An adaptive structural summary for graph-structured data
-
San Diego, CA, USA, Jun. 9-12
-
Chen Q, Lim A et al. D(k)-index: An adaptive structural summary for graph-structured data. In Proc. the ACM SIGMOD Int. Conf. Management of Data, San Diego, CA, USA, Jun. 9-12, 2003, pp.134-144.
-
(2003)
Proc. the ACM SIGMOD Int. Conf. Management of Data
, pp. 134-144
-
-
Chen, Q.1
Lim, A.2
-
2
-
-
0036211171
-
Exploiting local similarity for efficient indexing of paths in graph structured data
-
San Jose, CA, USA, Feb. 26-Mar. 1
-
Kaushik R, Shenoy P et al. Exploiting local similarity for efficient indexing of paths in graph structured data. In Proc. the 18th Int. Conf. Data Engineering, San Jose, CA, USA, Feb. 26-Mar. 1, 2002, pp.129-140.
-
(2002)
Proc. the 18th Int. Conf. Data Engineering
, pp. 129-140
-
-
Kaushik, R.1
Shenoy, P.2
-
3
-
-
80052793558
-
Index structures for path expressions
-
Jerusalem, Israel, Jan. 10-12
-
Milo T, Suciu D. Index structures for path expressions. In Proc. the 7th Int. Conf. Database Theory, Jerusalem, Israel, Jan. 10-12, 1999, pp.277-295.
-
(1999)
Proc. the 7th Int. Conf. Database Theory
, pp. 277-295
-
-
Milo, T.1
Suciu, D.2
-
4
-
-
85012146515
-
Efficient mining of XML query patterns for caching
-
Berlin, Germany, Sept. 9-12
-
Yang L H, Lee M L et al. Efficient mining of XML query patterns for caching. In Proc. the 29th Int. Conf. Very Large Data Bases, Berlin, Germany, Sept. 9-12, 2003, pp.69-80.
-
(2003)
Proc. the 29th Int. Conf. Very Large Data Bases
, pp. 69-80
-
-
Yang, L.H.1
Lee, M.L.2
-
5
-
-
4444326044
-
Mining closed sequential patterns in large databases
-
San Francisco, CA, USA, May 1-3, Electronic Edition
-
Yan X, Han J et al. Mining closed sequential patterns in large databases. In Proc. the 3rd SIAM Int. Conf. Data Mining, San Francisco, CA, USA, May 1-3, 2003, Electronic Edition.
-
(2003)
Proc. the 3rd SIAM Int. Conf. Data Mining
-
-
Yan, X.1
Han, J.2
-
6
-
-
84880088183
-
Finding frequent substructures in chemical compounds
-
New York, USA, Aug. 27-31
-
Dehaspe L, Toivonen H et al. Finding frequent substructures in chemical compounds. In Proc. 4th Int. Conf. Knowledge Discovery and Data Mining, New York, USA, Aug. 27-31, 1998, pp.30-36.
-
(1998)
Proc. 4th Int. Conf. Knowledge Discovery and Data Mining
, pp. 30-36
-
-
Dehaspe, L.1
Toivonen, H.2
-
7
-
-
0002740930
-
Mining temporal relationals with multiple granularities in time sequences
-
Bettini C, Wang X et al. Mining temporal relationals with multiple granularities in time sequences. IEEE Data Engineering Bulletin, 1998, 21(1): 32-38.
-
(1998)
IEEE Data Engineering Bulletin
, vol.21
, Issue.1
, pp. 32-38
-
-
Bettini, C.1
Wang, X.2
-
8
-
-
0035016443
-
PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth
-
Heidelberg, Germany, April 2-6
-
Pei J, Han J et al. PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In Proc. the 18th Int. Conf. Data Engineering, Heidelberg, Germany, April 2-6, 2001, pp.215-224.
-
(2001)
Proc. the 18th Int. Conf. Data Engineering
, pp. 215-224
-
-
Pei, J.1
Han, J.2
-
9
-
-
33751066441
-
Exploit sequencing to accelerate hot XML query pattern mining
-
Dijon, France, Apr. 23-27
-
Feng J, Qian Q et al. Exploit sequencing to accelerate hot XML query pattern mining. In Proc. the 2006 ACM Symp. Applied Computing, Dijon, France, Apr. 23-27, 2006, pp.517-524.
-
(2006)
Proc. the 2006 ACM Symp. Applied Computing
, pp. 517-524
-
-
Feng, J.1
Qian, Q.2
-
11
-
-
2442446148
-
-
Wang J, Han J. BIDE: Efficient mining of frequent closed sequences. In Proc. the 20th Int. Conf. Data Engineering, Boston, MA, USA, Mar. 30-Apr. 2, 2004, pp.79-90.
-
Wang J, Han J. BIDE: Efficient mining of frequent closed sequences. In Proc. the 20th Int. Conf. Data Engineering, Boston, MA, USA, Mar. 30-Apr. 2, 2004, pp.79-90.
-
-
-
-
12
-
-
78149312583
-
Frequent subgraph discovery
-
San Jose, CA, USA, Nov. 29-Dec. 2
-
Kuramochi M, Karypis G. Frequent subgraph discovery. In Proc. the 1st IEEE Int. Conf. Data Mining, San Jose, CA, USA, Nov. 29-Dec. 2, 2001, pp.313-320.
-
(2001)
Proc. the 1st IEEE Int. Conf. Data Mining
, pp. 313-320
-
-
Kuramochi, M.1
Karypis, G.2
-
13
-
-
0001882616
-
Fast algorithms for mining association rules
-
Santiago de Chile, Chile, Sept. 12-15
-
Agrawal R, Srikant R. Fast algorithms for mining association rules. In Proc. the 20th Int. Conf. Very Large Data Bases, Santiago de Chile, Chile, Sept. 12-15, 1994, pp.487-499.
-
(1994)
Proc. the 20th Int. Conf. Very Large Data Bases
, pp. 487-499
-
-
Agrawal, R.1
Srikant, R.2
-
14
-
-
0242709382
-
Efficiently mining frequent trees in a forest
-
Edmonton, Alberta, Canada, Jul. 23-26
-
Zaki M. Efficiently mining frequent trees in a forest. In Proc. the 8th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada, Jul. 23-26, 2002, pp.71-80.
-
(2002)
Proc. the 8th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining
, pp. 71-80
-
-
Zaki, M.1
-
15
-
-
4544334171
-
Efficient substructure discovery from large semi-structured data
-
Arlington, VA, USA, Apr. 11-13, Electronic Edition
-
Asai T, Abe K et al. Efficient substructure discovery from large semi-structured data. In Proc. the 2nd SIAM Int. Conf. Data Mining, Arlington, VA, USA, Apr. 11-13, 2002, Electronic Edition.
-
(2002)
Proc. the 2nd SIAM Int. Conf. Data Mining
-
-
Asai, T.1
Abe, K.2
-
16
-
-
3042780922
-
TreeFinder: A first step towards XML data mining
-
Maebashi, Japan, Dec. 9-12
-
Termier A, Rousset M C et al. TreeFinder: A first step towards XML data mining. In Proc. the 2nd IEEE Int. Conf. Data Mining, Maebashi, Japan, Dec. 9-12, 2002, pp.450-457.
-
(2002)
Proc. the 2nd IEEE Int. Conf. Data Mining
, pp. 450-457
-
-
Termier, A.1
Rousset, M.C.2
-
17
-
-
0034593066
-
FreeSpan: Frequent pattern-projected sequential pattern mining
-
Boston, MA, USA, Aug. 20-23
-
Han J, Pei J et al. FreeSpan: Frequent pattern-projected sequential pattern mining. In Proc. the 6th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, Boston, MA, USA, Aug. 20-23, 2000, pp.355-359.
-
(2000)
Proc. the 6th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining
, pp. 355-359
-
-
Han, J.1
Pei, J.2
-
18
-
-
84947770983
-
The PSP approach for mining sequential patterns
-
Nantes, France, Sept. 23-26
-
Masseglia F, Cathala F et al. The PSP approach for mining sequential patterns. In Proc. the 2nd European Symp. Principles of Data Mining and Knowledge Discovery, Nantes, France, Sept. 23-26, 1998, pp.176-184.
-
(1998)
Proc. the 2nd European Symp. Principles of Data Mining and Knowledge Discovery
, pp. 176-184
-
-
Masseglia, F.1
Cathala, F.2
-
19
-
-
0029212693
-
Mining sequential patterns: Generalizations and performance improvements
-
Avignon, France, Mar. 25-29
-
Srikant R, Agrawal R. Mining sequential patterns: Generalizations and performance improvements. In Proc. the 5th Int. Conf. Extending Database Technology, Avignon, France, Mar. 25-29, 1996, pp.3-17.
-
(1996)
Proc. the 5th Int. Conf. Extending Database Technology
, pp. 3-17
-
-
Srikant, R.1
Agrawal, R.2
-
20
-
-
0031702885
-
Cyclic association rules
-
Orlando, Florida, USA, Feb. 23-27
-
Ozden B, Ramaswamy S et al. Cyclic association rules. In Proc. the 14th Int. Conf. Data Engineering, Orlando, Florida, USA, Feb. 23-27, 1998, pp.412-421.
-
(1998)
Proc. the 14th Int. Conf. Data Engineering
, pp. 412-421
-
-
Ozden, B.1
Ramaswamy, S.2
-
21
-
-
0032627945
-
Proc. the 18th Int. Conf. Data Engineering
-
Sydney, Australia, Mar. 23-26
-
Han J, Dong G et al. Efficient mining of partial periodic patterns in time series database. In Proc. the 18th Int. Conf. Data Engineering, Sydney, Australia, Mar. 23-26, 1999, pp.106-115.
-
(1999)
Efficient mining of partial periodic patterns in time series database
, pp. 106-115
-
-
Han, J.1
Dong, G.2
-
22
-
-
0036373130
-
Mining long sequential patterns in a noisy environment
-
Madison, WI, USA, Jun. 3-6
-
Yang J, Yu P S et al. Mining long sequential patterns in a noisy environment. In Proc. 2003 ACM SIGMOD Int. Conf. Management of Data, Madison, WI, USA, Jun. 3-6, 2002, pp.406-417.
-
(2002)
Proc. 2003 ACM SIGMOD Int. Conf. Management of Data
, pp. 406-417
-
-
Yang, J.1
Yu, P.S.2
-
23
-
-
14644411753
-
Mining closed and maximal frequent subtrees from databases of labeled rooted trees
-
Chi Y, Xia Y et al. Mining closed and maximal frequent subtrees from databases of labeled rooted trees. IEEE Trans. Knowledge and Data Engineering, 2005, 17(2): 190-202.
-
(2005)
IEEE Trans. Knowledge and Data Engineering
, vol.17
, Issue.2
, pp. 190-202
-
-
Chi, Y.1
Xia, Y.2
-
25
-
-
0141783373
-
XQuery 1.0: An XML query language
-
Recommendation, June
-
Boag S, Chamberlin D et al. XQuery 1.0: An XML query language. W3C Candidate Recommendation, June, 2006, http://www.w3.org/TR/xquery.
-
(2006)
Candidate
, vol.W3C
-
-
Boag, S.1
Chamberlin, D.2
-
26
-
-
2442531722
-
-
Raw P R, Moon B. PRIX: Indexing and querying XML using Prufer sequences. In Proc. the 20th Int. Conf. Data Engineering, Boston, MA, USA, Mar. 30-Apr. 2, 2004, pp.288-300.
-
Raw P R, Moon B. PRIX: Indexing and querying XML using Prufer sequences. In Proc. the 20th Int. Conf. Data Engineering, Boston, MA, USA, Mar. 30-Apr. 2, 2004, pp.288-300.
-
-
-
-
27
-
-
0005261636
-
-
Dissertation, University of California, San Diego, USA
-
Picciotto S. How to encode a tree [Dissertation]. University of California, San Diego, USA, 1999.
-
(1999)
How to encode a tree
-
-
Picciotto, S.1
-
28
-
-
84943398807
-
Mining frequent query patterns from XML queries
-
Kyoto, Japan, Mar. 26-28
-
Yang L, Lee M L et al. Mining frequent query patterns from XML queries. In Proc. the 8th Int. Conf. Database Systems for Advanced Applications, Kyoto, Japan, Mar. 26-28, 2003, pp.355-362.
-
(2003)
Proc. the 8th Int. Conf. Database Systems for Advanced Applications
, pp. 355-362
-
-
Yang, L.1
Lee, M.L.2
|