-
Notifications
You must be signed in to change notification settings - Fork 0
/
paper.bib
5916 lines (4966 loc) · 152 KB
/
paper.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
@String{PODS = "Proc. of ACM Symposium on Principles of Database
Systems (PODS)"}
@String{DBPL = "Proc. of Int'l Workshop on Database Programming Languages (DBPL)"}
@String{JCSS = {Journal of Computer and System Sciences (JCSS)}}
@String{TKDE = {IEEE Trans. on Data and Knowledge Engineering}}
@String{CACM = {Communicationforeign keyss of the ACM}}
@String{ACMCS = {ACM Computing Surveys}}
@String{JACM = {Journal of the ACM}}
@String{TSE = {IEEE Trans. on Software Engineering}}
@String{TOOIS = "ACM Trans. on Office Information Systems"}
@String{TODS = "ACM Trans. on Database Systems"}
@String{TOPLAS = "ACM Trans. on Programming Languages and Systems"}
@String{VLDB = "Proc. of Int'l Conf. on Very Large Databases (VLDB)"}
@String{ICDT = "Proc. of Int'l Conf. on Database Theory (ICDT)"}
@String{ICDE = "Proc. of IEEE Int'l Conf. on Data Engineering (ICDE)"}
@String{OODBS86 = "Proc. of IEEE Int'l Workshop on Object-Oriented Database Systems"}
@String{SIGMOD = "Proc. of ACM SIGMOD Conf. on Management of Data"}
@String{SIGPLAN = "Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation"}
@String{Wesley = "Addison Wesley, Reading, MA"}
@String{BTW = "Proceedings der GI-Fachtagung Datenbanksysteme f{\"u}r B{\"u}ro, Technik und Wissenschaft (BTW)"}
@String{DOOD = "Proceedings International Conference on Deductive and Object-Oriented Databases (DOOD)"}
@String{DKEng = "Data \& Knowledge Engineering"}
@String{IJCAI = "International Joint Conference on Artificial Intelligence"}
@String{AAAI = "Proceedings National Conference on Artificial Intelligence"}
@String{DAC= "Proceedings of Design Automation Conference"}
@String{EDBT= "Proceedings of the International Conference on Extending Database Technology"}
@String{HICSS= "Proceedings of the Hawaiian Conference on Computer and System Sciences"}
@String{FOOL = "Proceedings of the Foundations of Object-Oriented Languages Workshop"}
@String{TCS = "Theoretical Computer Science"}
@String{TSI = "Technology and Science of Informatics"}
@String{SEMIWORK = "Workshop on Management of Semistructured Data"}
@String{ACMTOIS = "ACM Transactions on Information Systems"}
@String{DL = "Proceedings of ACM Conference on Digital Libraries"}
@String{COOPIS = {Proceedings of International Conference on Cooperative Information Systems (CoopIS)}}
@String{LNCS = {Lecture Notes in Computer Science}}
@String{WWW = {Proceedings of International {W}orld {W}ide {W}eb Conference}}
@String{RIDE = {Research Issues in Data Engineering}}
@String{NGITS = {Next Generation Information Technologies and
Systems}}
@String{LICS = {Proceedings of Logic in Computer Science (LICS)}}
@string{siamjc = "{SIAM} Journal on Computing"}
@string{tsmc = "{IEEE} Transactions on Systems, Man, and Cybernetics"}
@INPROCEEDINGS{Han01b,
AUTHOR={A. Robles-Kelly and E.R.Hancock},
TITLE={Graph Matching using Adjacency Matrix Markov Chains},
BOOKTITLE={British Machine Vision Conference},
YEAR={2001},
}
@inproceedings{DorrigivLS08,
author = {Reza Dorrigiv and
Alejandro L{\'o}pez-Ortiz and
Alejandro Salinger},
title = {Optimal speedup on a low-degree multi-core parallel architecture
({LoPRAM})},
booktitle = {SPAA},
year = {2008},
pages = {185-187}
}
@ARTICLE{PEL99,
AUTHOR={M. Pelillo and K. Siddiqi and S. Zucker},
TITLE={Matching Hierarchical Structures Using Association Graphs},
JOURNAL={IEEE Transactions on Pattern Analysis and Machine
Intelligence},
VOLUME={21},
NUMBER={11},
MONTH={November},
YEAR={1999},
PAGES={1105--1120}}
@ARTICLE{gr96,
AUTHOR={S. Gold and A. Rangarajan},
title = {A Graduated Assignment Algorithm for Graph
Matching},
JOURNAL={IEEE Transactions on Pattern Analysis and Machine Intelligence},
VOLUME={18},
pages = {377--388},
year = {1996}}
@ARTICLE{hz83,
AUTHOR={R. Hummel and S. Zucker},
TITLE={On the foundations of relaxation labeling processes},
JOURNAL={IEEE PAMI},
VOLUME={5},
PAGES={267--287},
YEAR={1983}}
@ARTICLE{lw66,
AUTHOR={E. Lawler and D. Wood},
TITLE={Branch and Bound methods: A survey},
JOURNAL={Operations Research},
VOLUME={14},
PAGES={699--719},
YEAR={1966}}
@Article{css2003,
author = {B. Csaba, A. and Shokoufandeh and E. Szemer\'edi},
title = {Proof of a Conjecture of Bollobas and Eldridge for
Graphs of Maximum Degree Three},
journal = "Combinatorica",
year = 2003,
volume = 23,
pages = {35-72}
}
@Article{coha63,
author = {H. Corr\'adi and A. Hajnal},
title = {On the Maximal Number of Independent Circuits in a Graph},
journal = "Acta Math. Hung.",
year = 1963,
volume = 14,
pages = {423-439}
}
@Article{alfs96,
author = {N. Alon and E. Fischer},
title = {$2$-factors in dense graphs},
journal = "Discrete Math.",
year = 1996,
volume = 152,
pages = {13-23}
}
@INCOLLECTION{hasz70,
AUTHOR={A. Hajnal and E. Szemer\'edi},
TITLE={Proof of a Conjecture of Erd\"{o}s},
BOOKTITLE={Combinatorial Theory and Its Applications, II},
EDITOR={P. Erd\"{o}s and V. T. S\'os, Eds.},
PUBLISHER={Colloquia Mathematica Societatis J\'anos Bolyai,
North-Holland, Amsterdam/London},
YEAR={1970}}
@Article{be78,
author = {B. Bollob\'as and S.E. Eldridge},
title = {Packing of Graphs and Applications to Computational Complexity},
journal = "Journal of Combinatorial Theory, Series B",
year = 1978,
volume = 25,
pages = {105-124}
}
@Article{KS93,
author = {J. Koml\'os, M. Simonovits},
title = { Regularity Lemma and its Applications in Graphs Theory},
journal = {Combinatorics, Paul Erd\"{o}s is eighty},
year = 1993,
volume = 2,
pages = {295-352}
}
@article{BusyginBP02,
author = {Stanislav Busygin and
Sergiy Butenko and
Panos M. Pardalos},
title = {A Heuristic for the Maximum Independent Set Problem Based
on Optimization of a Quadratic Over a Sphere.},
journal = {J. Comb. Optim.},
volume = {6},
number = {3},
year = {2002},
pages = {287-297}
}
@Misc{busyginsoftware,
author = {Stanislav Busygin},
title = {{{QUALEX}: {QU}ick {AL}most {EX}act maximum weight clique/independent set solver}},
howpublished = {{\sl http://www. busygin.dp.ua/npc.html}}
}
@Misc{uwxml,
author = {University of Washington},
title = {{XML} Repository},
howpublished = {\\ {\sl http://www.cs.washington.edu/research/xmldatasets}}
}
@TechReport{wadler,
author = {Philip Wadler},
title = {A Formal Semantics for Patterns in XSL},
institution = {Bell Labs},
year = 2000
}
@manual{xmlschema0,
organization = "{World Wide Web Consortium (W3C)}",
title ="{XML} Schema Part 0: Primer ",
editor = "David C. Fallside",
year = 2000,
note = "{\tt http://www.w3.org/TR/xmlschema-0/ }"
}
@book{dotw,
author = "Serge Abiteboul and Peter Buneman and Dan Suciu",
title = "Data on the {Web}. From Relations to Semistructured Data and {XML}",
publisher = "Morgan Kaufman",
year = "2000"
}
@Misc{ThBeMaMe2000,
author = {W3C},
title = {{XML Schema}},
howpublished = {W3C Working Draft},
month = may,
year = 2001
}
@Misc{ClDe1999,
author = {James Clark and Steve DeRose},
title = {{XML Path Language (XPath)}},
howpublished = {W3C Working Draft},
month = nov,
year = 1999
}
@Book{AbHuVi1995,
author = {Serge Abiteboul and Richard Hull and Victor Vianu},
title = {Foundations of Databases},
publisher = {Addison-Wesley},
year = 1995
}
@Book{Raghu2000,
author = {Raghu Ramakrishnan and Johannes Gehrke},
title = {Database Management Systems},
publisher = {McGraw-Hill Higher Education},
year = 2000
}
@inproceedings{pods11-leonid,
author = {Pablo Barcel\'{o} and Leonid Libkin and Juan Reutter},
title = {Querying graph patterns},
booktitle = {PODS},
year = {2011}
}
@inproceedings{pods10-leonid,
author = {Pablo Barcel\'{o} and and Carlos A. Hurtado
and Leonid Libkin and Peter T. Wood},
title = {Expressive languages for path queries over graph-structured data},
booktitle = {PODS},
year = {2010}
}
@inproceedings{icdt12-leonid,
author = {Leonid Libkin and Domagoj Vrgoc},
title = {Regular Path Queries on Graphs with Data},
booktitle = {ICDT},
year = {2012}
}
@Book{HoUl79,
author = {John E. Hopcroft and Jeffery D. Ullman},
title = {Introduction to Automata Theory, Languages and Computation},
publisher = {Addision Wesley},
year = 1979
}
@Book{Papa1994,
author = {Christos H Papadimitriou},
title = {Computational Complexity},
publisher = {Addison-Wesley},
year = 1994
}
@book{fol,
author = "H. B. Enderton",
title = "A Mathematical Introduction to Logic",
publisher = "Academic Press",
year = "1972"
}
@Misc{BrPaSp1998,
author = {W3C},
title = {{Extensible Markup Language ({XML}) 1.0}},
howpublished = {W3C Recommendation},
year = 1998,
month = feb,
note = {\\\oneurl{http://www.w3.org/TR/REC-xml/}}
}
@Book{Ullm1988,
author = {Jeffrey D. Ullman},
title = {Database and Knowledge Base Systems},
publisher = {Computer Science Press},
year = 1988
}
@Book{GaJo79,
author = {Michael Garey and David Johnson},
title = {Computers and Intractability: A Guide to the Theory
of {NP}-Completeness},
publisher = {W. H. Freeman and Company},
year = 1979
}
@Book{LePa81,
author = {Harry R. Lewis and Christos H. Papadimitrious},
title = {Elements of the Theory of Computation},
publisher = {Prentice-Hall},
year = 1981
}
@Article{CoKaVa1990,
author = {Stavros S. Cosmadakis and Paris C. Kanellakis and Moshe Y. Vardi},
title = {Polynomial-Time Implication Problems for Unary Inclusion Dependencies},
journal = "JACM",
year = 1990,
volume = 37,
number = 1,
pages = {15-46},
month = jan
}
@InProceedings{BeMi1999,
author = {Catriel Beeri and Tova Milo},
title = {Schemas for Integration and Translation of
Structured and Semi-Structured Data},
booktitle = "ICDT",
year = 1999
}
@Article{Papa1981,
author = {Christos H. Papadimitriou},
title = {On the Complexity of Integer Programming},
journal = {J. {ACM}},
year = 1981,
volume = 28,
number = 4,
pages = {765-768}
}
@Article{Lenstra,
author = {H. W. Lenstra},
title = {Integer Programming in a Fixed Number of Variables},
journal = {{Math. Oper. Res.}},
volume = 8,
pages = {538-548},
year = 1983
}
@book{sql,
author = {J. Melton and A. Simon},
title = {Understanding the New {SQL}: A Complete Guide},
publisher = {Morgan Kaufman},
year = 1993
}
@book{solvable,
author = {B. Dreben and W. D. Goldfarb},
title = {The Decision Problem:
Solvable Classes of Quantificational Formulas},
publisher = {Addison-Wesley},
year = 1979
}
@Article{MaRo1975,
author = {Y Matiyasevich and J Robinson},
title = {Reduction of an arbitrary {Diophantine} equation to
one in 13 unknowns},
journal = {{Acta Arithmetica}},
volume = 27,
pages = {521-553},
year = 1975
}
@InProceedings{Tarskian,
author = {David McAllester and Robert Givan and
Carl Witty and Dexter Kozen},
title = {Tarskian Set Constraints},
booktitle = LICS,
year = 1996
}
@inproceedings{victor-update,
author = {Yannis Papakonstantinou and Victor Vianu},
title = {Incremental Validation of {XML} Documents},
booktitle = {ICDT},
year = 2003
}
@inproceedings{atg,
author = {Michael Benedikt and Chee Yong Chan and
Wenfei Fan and Rajeev Rastogi and
Shihui Zheng and Aoying Zhou},
title = {{DTD}-Directed
Publishing with Attribute Translation Grammars},
booktitle = {VLDB},
year = 2002
}
@book{tree-automata,
author = "Hubert Comon and Max Dauchet and Remi Gilleron and
Florent Jacquemard and Denis Ligiez and Sophie Tison
and Marc Tommasa",
title = "Tree Automata Techniques and Applications",
publisher = "Online",
year = 1999
}
@ARTICLE{rm94,
AUTHOR={A. Rangarajan and E. Mjolsness},
title = {A Lagrangian Relaxation Network for Graph Matching},
JOURNAL={IEEE Intl. Conf. on Neural Networks (ICNN)},
VOLUME={7},
pages = {4629--4634, IEEE Press},
year = {1994}}
@ARTICLE{ad93,
AUTHOR={H. A. Almohamad and S.O. Duffuaa},
TITLE={A Linear Programming Approach for the Weighted Graph
Matching Problem},
JOURNAL={IEEE Trans. Patt. Anal. Mach. Intell.},
VOLUME={15},
PAGES={522--525},
YEAR={1993}}
@ARTICLE{um88,
AUTHOR={S. Umeyama},
TITLE={An Eigendecomposition Approach to Weighted Graph
Matching Problems},
JOURNAL={IEEE Trans. Patt. Anal. Mach. Intell.},
VOLUME={10},
PAGES={695--703},
YEAR={1988}}
@inproceedings{integration-survey1,
author = {Maurizio Lenzerini},
title = {Data Integration: A Theoretical Perspective},
booktitle = {PODS},
year = 2002
}
@ARTICLE{views-survey,
author = {Alon Y. Halevy},
title = {Answering queries using views: A survey},
journal = {VLDB J.},
year = {2001},
volume = {10},
number = {4},
pages = {270-294}
}
@article{regular-path,
author = {Diego Calvanese
and Giuseppe De Giacomo and Maurizio Lenzerini and Moshe Y. Vardi},
title = {Rewriting of Regular Expressions and Regular Path Queries},
journal = {JCSS},
volume = {64},
number = {3},
pages = {443-465},
year = {2002}
}
@article{integration-survey2,
author = {Erhard Rahm and Philip A. Bernstein},
title={A survey of approaches to automatic schema matching},
journal={{VLDB Journal}},
year={2001}
}
@Article{agsurvey,
author = {Alexandru Mateescu and Arto Salomaa},
title = {Aspects of classical language theory},
journal = {{Handbook of Formal Languages, vol. 1}},
year = 1997
}
@book{Hopcroft69,
author = {Hopcroft, John E. and Ullman, Jeffrey D.},
title = {Formal languages and their relation to automata},
year = {1969},
publisher = {Addison-Wesley Longman Publishing Co., Inc.}
}
@Article{AGs,
author = {P. Deransart and M. {Jourdan (eds)}},
title = {{Attribute Grammars and their Applications}},
journal = {LNCS 461},
publisher = {{Spinger-Verlag}},
year = 1990
}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@inproceedings{HoS91:pdis,
author = {W. Hong and M. Stonebraker},
title = "{Optimization of Parallel Query Execution Plans in XPRS}",
booktitle = "PDIS",
year = {1991},
pages = {218-225},
address = "Miami Beach, Florida",
month = "December"
}
@article{Kos00:csur,
author = "D. Kossman",
title = "{The State of the Art in Distributed Query Processing}",
journal = "ACM Computing Surveys",
month = "Dec",
volume = 32,
number = 4,
pages = {422-469},
year = "2000" }
@article{KoS00:tods,
author = "D. Kossman and K. Stocker",
title = "{Iterative Dynamic Programming: A New Class of Query Optimization Algorithms}",
journal = "TODS",
month = "March",
volume = 25,
number = 1,
pages = {43-82},
year = "2000" }
@inproceedings{WFA95:sigmod,
author = {A.N. Wilschut and J. Flokstra and P.M.G. Apers},
title = "{Parallel Evaluation of Multi-Join Queries}",
booktitle = "SIGMOD",
year = {1995}
}
@inproceedings{CaL86:sigmod,
author = {M.J. Carey and H. Lu},
title = "{Load Balancing in a Locally Distributed Database System}",
booktitle = "SIGMOD",
year = {1986}
}
@inproceedings{DSD95:sigmod,
author = {W. Du and M.-C. Shan and U. Dayal},
title = "{Reducing Multidatabase Query Response Time by Tree Balancing}",
booktitle = "SIGMOD",
year = {1995}
}
@InProceedings{hector02,
author= {Sergey Melnik and Hector Garcia-Molina and Erhard Rahm},
title={Similarity Flooding: A Versatile Graph Matching Algorithm},
booktitle="ICDE",
year= 2002
}
@InProceedings{flexibleGQ,
author= {Federica Mandreoli and Riccardo Martoglia and Wilma Penzo},
title={Flexible Query Answering on Graph-modeled Data},
booktitle="EDBT",
year= 2000
}
@InProceedings{mitra00,
author= {Prasenjit Mitra and Gio Wiederhold and Martin L. Kersten},
title={A Graph-Oriented Model for Articulation of Ontology Interdependencies},
booktitle="EDBT",
year= 2000
}
@InProceedings{bernstein03-2,
author = {Rachel Pottinger and Philip A. Bernstein},
title = {Merging Models Based on Given Correspondences},
booktitle = "VLDB",
year = 2003
}
@InProceedings{Skat,
author= {Prasenjit Mitra and Gio Wiederhold and Martin L. Kersten},
title={A Graph-Oriented Model for Articulation of Ontology Interdependencies},
booktitle="EDBT",
year= 2000
}
@ARTICLE{ab93,
AUTHOR={M. Aigner and S. Brandt},
TITLE={Embedding arbitrary graphs of maximum degree two},
JOURNAL={J. London Math. Soc.,},
VOLUME={48},
YEAR={1993},
PAGES={39-51}}
@ARTICLE{Gabow91,
AUTHOR={H. N. Gabow and R. E. Tarjan},
TITLE={Faster Scaling Algorithms for General Graph-Matching
Problems},
JOURNAL={JACM },
VOLUME={38},
NUMBER={4},
YEAR={1991},
PAGES={815-853}}
@ARTICLE{Fredman87,
AUTHOR={M. L. Fredman and R. E. Tarjan},
TITLE={Fibonacci heaps and their uses in improved network
optimization algorithms},
JOURNAL={JACM},
VOLUME={34},
YEAR={1987},
PAGES={596-615}}
@article{zss:ipl92,
author = {Zhang, Kaizhong and Statman, Rick
and Shasha, Dennis},
title = {{On the editing distance between unordered
labeled trees}},
journal = ipl,
year = 1992,
month = may,
volume = 42,
pages = {133--139},
}
@article{km:siamjc95,
author = {Kilpel{\" a}inen, Pekka and Mannila, Heikki},
title = {{Ordered and Unordered Tree Inclusion}},
journal = siamjc,
year = 1995,
month = apr,
volume = 24,
number = 2,
pages = {340--356}
}
@article{swzs:tsmc94,
author = {Shasha, Dennis and Wang, Jason Tsong Li and
Zhang, Kaizhong and Shih, Frank Y.},
title = {{Exact and Approximate Algorithms for Unordered
Tree Matching}},
journal = tsmc,
year = 1994,
month = apr,
volume = 24,
number = 4,
pages = {668--678},
mynotes = {
}}
@book{apostolico-galil:97,
editor = {Apostolico, Alberto and Galil, Zvi},
title = {{Pattern Matching Algorithms}},
year = 1997,
publisher = {Oxford University Press},
mynotes = {
}}
@book{aho-etal:74,
author = {Aho, Alfred V. and Hopcroft, John E. and Ullman, Jeffrey D.},
title = {{The Design and Analysis of Computer Algorithms}},
year = 1974,
publisher = {Addison-Wesley Publishing Company},
mynotes = {
}}
@inproceedings{Maarten,
author = {Maarten Marx},
title = {{XPath} with Conditional Axis Relations},
booktitle = {EDBT},
year = {2004}
}
@inproceedings{sat,
author = {M Benedikt and W Fan and F Geerts},
title = {{XPath} satisfiability in the presence of {DTDs}},
booktitle = "PODS",
year = 2005
}
@article{subiso76,
author = {Ullmann, J. R.},
title = {An Algorithm for Subgraph Isomorphism},
journal = {JACM},
volume = {23},
number = {1},
year = {1976},
pages = {31-42}
}
@Article{even-path,
author = {A LaPaugh and Christos Papadimitriou},
title = {The even-path problem for graphs and digraphs},
journal = "Networks",
volume = 14,
pages = {507-513},
year = 1984
}
@article{embedding,
author = {Wenfei Fan and Philip Bohannon},
title = {Information Preserving {XML} Schema Embedding},
journal = {TODS},
volume = 33,
number = 1,
year = 2008
}
@inproceedings{Joshi03,
author = {Sachindra {Joshi et al}},
title = {A bag of paths model for measuring structural similarity in
{Web} documents},
booktitle = {KDD},
year = {2003}
}
@inproceedings{Neardup07,
author = {Gurmeet Singh Manku and Arvind Jain and Anish Das Sarma},
title = {Detecting near-duplicates for {Web} crawling},
booktitle = {WWW},
year = {2007}
}
@inproceedings{AGU03ext,
author = {Arvind Arasu and Hector Garcia-Molina and Stanford University},
title = {Extracting structured data from {Web} pages},
booktitle = {SIGMOD},
year = {2003}
}
@article{DH99,
author = {Jeffrey Dean and Monika R. Henzinger},
title = {Finding related pages in the {World Wide Web}},
journal = {Comput. Netw.},
volume = {31},
number = {11-16},
year = {1999}
}
@INPROCEEDINGS{Melnik02,
author = {Sergey Melnik and Hector Garcia-molina and Erhard Rahm},
title = {Similarity flooding: A versatile graph matching algorithm},
booktitle = {ICDE},
year = {2002}
}
@INPROCEEDINGS{Dehmer_applicationof,
author = {Matthias Dehmer and Frank Emmert Streib and Er Mehler and J??rgen Kilian and Max M??hlh??user},
title = {Application of a similarity measure for graphs to
{Web}-based document structures},
booktitle = {International Conference on Data Analysis ICA},
year = {2005}
}
@article{repliweb,
author = {Junghoo Cho and Narayanan Shivakumar and Hector Garcia-Molina},
title = {Finding replicated {Web} collections},
journal = {SIGMOD Rec.},
volume = {29},
number = {2},
year = {2000}
}
@article{syntacweb,
author = {Andrei Z. Broder and Steven C. Glassman and Mark S. Manasse and Geoffrey Zweig},
title = {Syntactic clustering of the {Web}},
journal = {Comput. Netw. ISDN Syst.},
volume = {29},
number = {8-13},
year = {1997}
}
@article{Authos99,
author = {Jon M. Kleinberg},
title = {Authoritative sources in a hyperlinked environment},
journal = {J. ACM},
volume = {46},
number = {5},
year = {1999}
}
@inproceedings{tra99,
author = {Ravi Kumar and Prabhakar Raghavan and Sridhar Rajagopalan and Andrew Tomkins},
title = {Trawling the {Web} for emerging cyber-communities},
booktitle = {WWW},
year = {1999}
}