id	sid	tid	token	lemma	pos
ajis02-68	1	1	microsoft	microsoft	PROPN
ajis02-68	1	2	word	word	NOUN
ajis02-68	1	3	13	13	NUM
ajis02-68	1	4	1	1	NUM
ajis02-68	1	5	marina.doc	marina.doc	PROPN
ajis02-68	1	6	ajis	ajis	ADV
ajis02-68	1	7	vol	vol	NOUN
ajis02-68	1	8	13	13	NUM
ajis02-68	1	9	,	,	PUNCT
ajis02-68	1	10	no	no	INTJ
ajis02-68	1	11	.	.	NOUN
ajis02-68	1	12	1	1	NUM
ajis02-68	1	13	september	september	PROPN
ajis02-68	1	14	2005	2005	NUM
ajis02-68	1	15	150	150	NUM
ajis02-68	1	16	securing	secure	VERB
ajis02-68	1	17	xml	xml	NOUN
ajis02-68	1	18	query	query	NOUN
ajis02-68	1	19	processing	processing	NOUN
ajis02-68	1	20	storage	storage	NOUN
ajis02-68	1	21	charles	charles	PROPN
ajis02-68	1	22	a.	a.	PROPN
ajis02-68	1	23	shoniregun	shoniregun	PROPN
ajis02-68	1	24	school	school	NOUN
ajis02-68	1	25	of	of	ADP
ajis02-68	1	26	computing	computing	NOUN
ajis02-68	1	27	and	and	CCONJ
ajis02-68	1	28	technology	technology	NOUN
ajis02-68	1	29	,	,	PUNCT
ajis02-68	1	30	university	university	PROPN
ajis02-68	1	31	of	of	ADP
ajis02-68	1	32	east	east	PROPN
ajis02-68	1	33	london	london	PROPN
ajis02-68	1	34	longbridge	longbridge	PROPN
ajis02-68	1	35	road	road	PROPN
ajis02-68	1	36	,	,	PUNCT
ajis02-68	1	37	dagenham	dagenham	PROPN
ajis02-68	1	38	,	,	PUNCT
ajis02-68	1	39	essex	essex	PROPN
ajis02-68	1	40	,	,	PUNCT
ajis02-68	1	41	rm8	rm8	PROPN
ajis02-68	1	42	2as	2as	PROPN
ajis02-68	1	43	,	,	PUNCT
ajis02-68	1	44	uk	uk	PROPN
ajis02-68	1	45	e	e	NOUN
ajis02-68	1	46	-	-	NOUN
ajis02-68	1	47	mail	mail	NOUN
ajis02-68	1	48	:	:	PUNCT
ajis02-68	1	49	c.shoniregun@uel.ac.uk	c.shoniregun@uel.ac.uk	VERB
ajis02-68	1	50	oleksandr	oleksandr	PROPN
ajis02-68	1	51	a.	a.	NOUN
ajis02-68	1	52	logvynovskiy	logvynovskiy	PROPN
ajis02-68	1	53	business	business	NOUN
ajis02-68	1	54	,	,	PUNCT
ajis02-68	1	55	computing	computing	NOUN
ajis02-68	1	56	,	,	PUNCT
ajis02-68	1	57	and	and	CCONJ
ajis02-68	1	58	information	information	NOUN
ajis02-68	1	59	management	management	NOUN
ajis02-68	1	60	(	(	PUNCT
ajis02-68	1	61	bcim	bcim	PROPN
ajis02-68	1	62	)	)	PUNCT
ajis02-68	1	63	,	,	PUNCT
ajis02-68	1	64	london	london	PROPN
ajis02-68	1	65	south	south	PROPN
ajis02-68	1	66	bank	bank	PROPN
ajis02-68	1	67	university	university	PROPN
ajis02-68	1	68	borough	borough	NOUN
ajis02-68	1	69	road	road	NOUN
ajis02-68	1	70	,	,	PUNCT
ajis02-68	1	71	se1	se1	PROPN
ajis02-68	1	72	0aa	0aa	NOUN
ajis02-68	1	73	,	,	PUNCT
ajis02-68	1	74	uk	uk	PROPN
ajis02-68	1	75	.	.	PROPN
ajis02-68	1	76	kevin	kevin	PROPN
ajis02-68	1	77	lu	lu	PROPN
ajis02-68	1	78	department	department	PROPN
ajis02-68	1	79	of	of	ADP
ajis02-68	1	80	information	information	NOUN
ajis02-68	1	81	systems	system	NOUN
ajis02-68	1	82	and	and	CCONJ
ajis02-68	1	83	computing	computing	PROPN
ajis02-68	1	84	brunel	brunel	PROPN
ajis02-68	1	85	university	university	PROPN
ajis02-68	1	86	uxbridge	uxbridge	NOUN
ajis02-68	1	87	ub8	ub8	ADJ
ajis02-68	1	88	3h	3h	NUM
ajis02-68	1	89	,	,	PUNCT
ajis02-68	1	90	uk	uk	PROPN
ajis02-68	1	91	abstract	abstract	VERB
ajis02-68	1	92	the	the	DET
ajis02-68	1	93	effective	effective	ADJ
ajis02-68	1	94	processing	processing	NOUN
ajis02-68	1	95	of	of	ADP
ajis02-68	1	96	semi	semi	ADJ
ajis02-68	1	97	-	-	ADJ
ajis02-68	1	98	structured	structured	ADJ
ajis02-68	1	99	data	datum	NOUN
ajis02-68	1	100	queries	query	NOUN
ajis02-68	1	101	is	be	AUX
ajis02-68	1	102	a	a	DET
ajis02-68	1	103	preliminary	preliminary	ADJ
ajis02-68	1	104	part	part	NOUN
ajis02-68	1	105	of	of	ADP
ajis02-68	1	106	data	datum	NOUN
ajis02-68	1	107	mining	mining	NOUN
ajis02-68	1	108	stage	stage	NOUN
ajis02-68	1	109	.	.	PUNCT
ajis02-68	2	1	xml	xml	NOUN
ajis02-68	2	2	queries	query	NOUN
ajis02-68	2	3	employ	employ	VERB
ajis02-68	2	4	regular	regular	ADJ
ajis02-68	2	5	path	path	NOUN
ajis02-68	2	6	expressions	expression	NOUN
ajis02-68	2	7	to	to	PART
ajis02-68	2	8	find	find	VERB
ajis02-68	2	9	structural	structural	ADJ
ajis02-68	2	10	patterns	pattern	NOUN
ajis02-68	2	11	within	within	ADP
ajis02-68	2	12	xml	xml	NOUN
ajis02-68	2	13	documents	document	NOUN
ajis02-68	2	14	.	.	PUNCT
ajis02-68	3	1	the	the	DET
ajis02-68	3	2	operation	operation	NOUN
ajis02-68	3	3	of	of	ADP
ajis02-68	3	4	structural	structural	ADJ
ajis02-68	3	5	join	join	NOUN
ajis02-68	3	6	is	be	AUX
ajis02-68	3	7	a	a	DET
ajis02-68	3	8	crucial	crucial	ADJ
ajis02-68	3	9	part	part	NOUN
ajis02-68	3	10	of	of	ADP
ajis02-68	3	11	xml	xml	NOUN
ajis02-68	3	12	query	query	NOUN
ajis02-68	3	13	processing	processing	NOUN
ajis02-68	3	14	.	.	PUNCT
ajis02-68	4	1	existing	exist	VERB
ajis02-68	4	2	approaches	approach	NOUN
ajis02-68	4	3	reduce	reduce	VERB
ajis02-68	4	4	complex	complex	ADJ
ajis02-68	4	5	join	join	NOUN
ajis02-68	4	6	expressions	expression	NOUN
ajis02-68	4	7	to	to	ADP
ajis02-68	4	8	several	several	ADJ
ajis02-68	4	9	binary	binary	ADJ
ajis02-68	4	10	structural	structural	ADJ
ajis02-68	4	11	joins	join	NOUN
ajis02-68	4	12	.	.	PUNCT
ajis02-68	5	1	in	in	ADP
ajis02-68	5	2	this	this	DET
ajis02-68	5	3	paper	paper	NOUN
ajis02-68	5	4	,	,	PUNCT
ajis02-68	5	5	we	we	PRON
ajis02-68	5	6	are	be	AUX
ajis02-68	5	7	proposing	propose	VERB
ajis02-68	5	8	a	a	DET
ajis02-68	5	9	new	new	ADJ
ajis02-68	5	10	structural	structural	ADJ
ajis02-68	5	11	join	join	NOUN
ajis02-68	5	12	algorithm	algorithm	NOUN
ajis02-68	5	13	called	call	VERB
ajis02-68	5	14	sequence	sequence	NOUN
ajis02-68	5	15	join	join	NOUN
ajis02-68	5	16	algorithm	algorithm	NOUN
ajis02-68	5	17	,	,	PUNCT
ajis02-68	5	18	for	for	ADP
ajis02-68	5	19	sequential	sequential	ADJ
ajis02-68	5	20	regular	regular	ADJ
ajis02-68	5	21	path	path	NOUN
ajis02-68	5	22	expressions	expression	NOUN
ajis02-68	5	23	in	in	ADP
ajis02-68	5	24	securing	secure	VERB
ajis02-68	5	25	xml	xml	NOUN
ajis02-68	5	26	query	query	NOUN
ajis02-68	5	27	processing	processing	NOUN
ajis02-68	5	28	storage	storage	NOUN
ajis02-68	5	29	.	.	PUNCT
ajis02-68	6	1	it	it	PRON
ajis02-68	6	2	exploits	exploit	VERB
ajis02-68	6	3	information	information	NOUN
ajis02-68	6	4	about	about	ADP
ajis02-68	6	5	position	position	NOUN
ajis02-68	6	6	of	of	ADP
ajis02-68	6	7	the	the	DET
ajis02-68	6	8	elements	element	NOUN
ajis02-68	6	9	in	in	ADP
ajis02-68	6	10	a	a	DET
ajis02-68	6	11	product	product	NOUN
ajis02-68	6	12	to	to	PART
ajis02-68	6	13	skip	skip	VERB
ajis02-68	6	14	generation	generation	NOUN
ajis02-68	6	15	of	of	ADP
ajis02-68	6	16	the	the	DET
ajis02-68	6	17	redundant	redundant	ADJ
ajis02-68	6	18	intermediate	intermediate	ADJ
ajis02-68	6	19	lists	list	NOUN
ajis02-68	6	20	.	.	PUNCT
ajis02-68	7	1	this	this	DET
ajis02-68	7	2	paper	paper	NOUN
ajis02-68	7	3	further	far	ADV
ajis02-68	7	4	discusses	discuss	VERB
ajis02-68	7	5	the	the	DET
ajis02-68	7	6	algorithm	algorithm	NOUN
ajis02-68	7	7	that	that	PRON
ajis02-68	7	8	performs	perform	VERB
ajis02-68	7	9	the	the	DET
ajis02-68	7	10	merge	merge	NOUN
ajis02-68	7	11	of	of	ADP
ajis02-68	7	12	several	several	ADJ
ajis02-68	7	13	input	input	NOUN
ajis02-68	7	14	lists	list	NOUN
ajis02-68	7	15	of	of	ADP
ajis02-68	7	16	nodes	node	NOUN
ajis02-68	7	17	in	in	ADP
ajis02-68	7	18	one	one	NUM
ajis02-68	7	19	pass	pass	NOUN
ajis02-68	7	20	.	.	PUNCT
ajis02-68	8	1	we	we	PRON
ajis02-68	8	2	carried	carry	VERB
ajis02-68	8	3	out	out	ADP
ajis02-68	8	4	comparative	comparative	ADJ
ajis02-68	8	5	experiments	experiment	NOUN
ajis02-68	8	6	,	,	PUNCT
ajis02-68	8	7	and	and	CCONJ
ajis02-68	8	8	the	the	DET
ajis02-68	8	9	results	result	NOUN
ajis02-68	8	10	prove	prove	VERB
ajis02-68	8	11	that	that	SCONJ
ajis02-68	8	12	the	the	DET
ajis02-68	8	13	algorithm	algorithm	NOUN
ajis02-68	8	14	is	be	AUX
ajis02-68	8	15	better	well	ADJ
ajis02-68	8	16	than	than	SCONJ
ajis02-68	8	17	multiple	multiple	ADJ
ajis02-68	8	18	binary	binary	NOUN
ajis02-68	8	19	joins	join	VERB
ajis02-68	8	20	algorithm	algorithm	NOUN
ajis02-68	8	21	for	for	ADP
ajis02-68	8	22	queries	query	NOUN
ajis02-68	8	23	of	of	ADP
ajis02-68	8	24	both	both	CCONJ
ajis02-68	8	25	small	small	ADJ
ajis02-68	8	26	and	and	CCONJ
ajis02-68	8	27	large	large	ADJ
ajis02-68	8	28	cardinality	cardinality	NOUN
ajis02-68	8	29	.	.	PUNCT
ajis02-68	9	1	keyword	keyword	NOUN
ajis02-68	9	2	:	:	PUNCT
ajis02-68	9	3	semi	semi	ADJ
ajis02-68	9	4	-	-	ADJ
ajis02-68	9	5	structured	structured	ADJ
ajis02-68	9	6	data	datum	NOUN
ajis02-68	9	7	mining	mining	NOUN
ajis02-68	9	8	,	,	PUNCT
ajis02-68	9	9	data	datum	NOUN
ajis02-68	9	10	model	model	NOUN
ajis02-68	9	11	,	,	PUNCT
ajis02-68	9	12	indexing	indexing	NOUN
ajis02-68	9	13	xml	xml	NOUN
ajis02-68	9	14	data	datum	NOUN
ajis02-68	9	15	,	,	PUNCT
ajis02-68	9	16	sequence	sequence	NOUN
ajis02-68	9	17	algorithm	algorithm	NOUN
ajis02-68	9	18	,	,	PUNCT
ajis02-68	9	19	graph	graph	NOUN
ajis02-68	9	20	numbering	numbering	NOUN
ajis02-68	9	21	,	,	PUNCT
ajis02-68	9	22	and	and	CCONJ
ajis02-68	9	23	query	query	NOUN
ajis02-68	9	24	processing	processing	NOUN
ajis02-68	9	25	.	.	PUNCT
ajis02-68	10	1	introduction	introduction	NOUN
ajis02-68	10	2	each	each	DET
ajis02-68	10	3	industry	industry	NOUN
ajis02-68	10	4	requires	require	VERB
ajis02-68	10	5	certain	certain	ADJ
ajis02-68	10	6	safeguards	safeguard	NOUN
ajis02-68	10	7	to	to	PART
ajis02-68	10	8	protect	protect	VERB
ajis02-68	10	9	its	its	PRON
ajis02-68	10	10	data	datum	NOUN
ajis02-68	10	11	while	while	SCONJ
ajis02-68	10	12	in	in	ADP
ajis02-68	10	13	transit	transit	NOUN
ajis02-68	10	14	.	.	PUNCT
ajis02-68	11	1	bringing	bring	VERB
ajis02-68	11	2	autonomic	autonomic	ADJ
ajis02-68	11	3	capabilities	capability	NOUN
ajis02-68	11	4	to	to	ADP
ajis02-68	11	5	storage	storage	NOUN
ajis02-68	11	6	systems	system	NOUN
ajis02-68	11	7	would	would	AUX
ajis02-68	11	8	certainly	certainly	ADV
ajis02-68	11	9	be	be	AUX
ajis02-68	11	10	an	an	DET
ajis02-68	11	11	improvement	improvement	NOUN
ajis02-68	11	12	,	,	PUNCT
ajis02-68	11	13	but	but	CCONJ
ajis02-68	11	14	if	if	SCONJ
ajis02-68	11	15	computing	computing	NOUN
ajis02-68	11	16	systems	system	NOUN
ajis02-68	11	17	that	that	PRON
ajis02-68	11	18	mine	mine	VERB
ajis02-68	11	19	data	datum	NOUN
ajis02-68	11	20	in	in	ADP
ajis02-68	11	21	those	those	DET
ajis02-68	11	22	storage	storage	NOUN
ajis02-68	11	23	repositories	repository	NOUN
ajis02-68	11	24	become	become	VERB
ajis02-68	11	25	next	next	ADJ
ajis02-68	11	26	to	to	ADP
ajis02-68	11	27	impossible	impossible	ADJ
ajis02-68	11	28	to	to	PART
ajis02-68	11	29	manage	manage	VERB
ajis02-68	11	30	,	,	PUNCT
ajis02-68	11	31	that	that	DET
ajis02-68	11	32	partial	partial	ADJ
ajis02-68	11	33	automation	automation	NOUN
ajis02-68	11	34	will	will	AUX
ajis02-68	11	35	not	not	PART
ajis02-68	11	36	yield	yield	VERB
ajis02-68	11	37	much	much	ADJ
ajis02-68	11	38	benefit	benefit	NOUN
ajis02-68	11	39	.	.	PUNCT
ajis02-68	12	1	xml	xml	NOUN
ajis02-68	12	2	is	be	AUX
ajis02-68	12	3	now	now	ADV
ajis02-68	12	4	becoming	become	VERB
ajis02-68	12	5	a	a	DET
ajis02-68	12	6	standard	standard	NOUN
ajis02-68	12	7	to	to	PART
ajis02-68	12	8	represent	represent	VERB
ajis02-68	12	9	and	and	CCONJ
ajis02-68	12	10	exchange	exchange	VERB
ajis02-68	12	11	semi	semi	ADJ
ajis02-68	12	12	-	-	ADJ
ajis02-68	12	13	structured	structured	ADJ
ajis02-68	12	14	data	datum	NOUN
ajis02-68	12	15	over	over	ADP
ajis02-68	12	16	the	the	DET
ajis02-68	12	17	web	web	NOUN
ajis02-68	12	18	(	(	PUNCT
ajis02-68	12	19	xyleme	xyleme	PROPN
ajis02-68	12	20	2001	2001	NUM
ajis02-68	12	21	,	,	PUNCT
ajis02-68	12	22	bray	bray	PROPN
ajis02-68	12	23	et	et	NOUN
ajis02-68	12	24	al	al	PROPN
ajis02-68	12	25	2000	2000	NUM
ajis02-68	12	26	)	)	PUNCT
ajis02-68	12	27	.	.	PUNCT
ajis02-68	13	1	the	the	DET
ajis02-68	13	2	problem	problem	NOUN
ajis02-68	13	3	of	of	ADP
ajis02-68	13	4	storing	store	VERB
ajis02-68	13	5	xml	xml	NOUN
ajis02-68	13	6	data	datum	NOUN
ajis02-68	13	7	in	in	ADP
ajis02-68	13	8	one	one	NUM
ajis02-68	13	9	or	or	CCONJ
ajis02-68	13	10	several	several	ADJ
ajis02-68	13	11	tables	table	NOUN
ajis02-68	13	12	is	be	AUX
ajis02-68	13	13	challenging	challenging	ADJ
ajis02-68	13	14	,	,	PUNCT
ajis02-68	13	15	since	since	SCONJ
ajis02-68	13	16	the	the	DET
ajis02-68	13	17	xml	xml	NOUN
ajis02-68	13	18	tree	tree	NOUN
ajis02-68	13	19	describe	describe	VERB
ajis02-68	13	20	some	some	DET
ajis02-68	13	21	irregular	irregular	ADJ
ajis02-68	13	22	structure	structure	NOUN
ajis02-68	13	23	while	while	SCONJ
ajis02-68	13	24	tables	table	NOUN
ajis02-68	13	25	are	be	AUX
ajis02-68	13	26	by	by	ADP
ajis02-68	13	27	definition	definition	NOUN
ajis02-68	13	28	regular	regular	ADJ
ajis02-68	13	29	.	.	PUNCT
ajis02-68	14	1	in	in	ADP
ajis02-68	14	2	a	a	DET
ajis02-68	14	3	situation	situation	NOUN
ajis02-68	14	4	where	where	SCONJ
ajis02-68	14	5	the	the	DET
ajis02-68	14	6	xml	xml	NOUN
ajis02-68	14	7	document	document	NOUN
ajis02-68	14	8	has	have	VERB
ajis02-68	14	9	no	no	DET
ajis02-68	14	10	schema	schema	NOUN
ajis02-68	14	11	,	,	PUNCT
ajis02-68	14	12	or	or	CCONJ
ajis02-68	14	13	when	when	SCONJ
ajis02-68	14	14	the	the	DET
ajis02-68	14	15	schema	schema	NOUN
ajis02-68	14	16	changes	change	VERB
ajis02-68	14	17	frequently	frequently	ADV
ajis02-68	14	18	,	,	PUNCT
ajis02-68	14	19	it	it	PRON
ajis02-68	14	20	has	have	VERB
ajis02-68	14	21	a	a	DET
ajis02-68	14	22	more	more	ADV
ajis02-68	14	23	dramatic	dramatic	ADJ
ajis02-68	14	24	impact	impact	NOUN
ajis02-68	14	25	on	on	ADP
ajis02-68	14	26	performance	performance	NOUN
ajis02-68	14	27	.	.	PUNCT
ajis02-68	15	1	the	the	DET
ajis02-68	15	2	key	key	ADJ
ajis02-68	15	3	idea	idea	NOUN
ajis02-68	15	4	behind	behind	ADP
ajis02-68	15	5	these	these	DET
ajis02-68	15	6	structures	structure	NOUN
ajis02-68	15	7	is	be	AUX
ajis02-68	15	8	called	call	VERB
ajis02-68	15	9	partial	partial	ADJ
ajis02-68	15	10	schema	schema	NOUN
ajis02-68	15	11	.	.	PUNCT
ajis02-68	16	1	the	the	DET
ajis02-68	16	2	partial	partial	ADJ
ajis02-68	16	3	schema	schema	NOUN
ajis02-68	16	4	helped	help	VERB
ajis02-68	16	5	to	to	PART
ajis02-68	16	6	build	build	VERB
ajis02-68	16	7	a	a	DET
ajis02-68	16	8	concise	concise	ADJ
ajis02-68	16	9	graph	graph	NOUN
ajis02-68	16	10	representing	represent	VERB
ajis02-68	16	11	paths	path	NOUN
ajis02-68	16	12	of	of	ADP
ajis02-68	16	13	the	the	DET
ajis02-68	16	14	data	datum	NOUN
ajis02-68	16	15	(	(	PUNCT
ajis02-68	16	16	wang	wang	PROPN
ajis02-68	16	17	&	&	CCONJ
ajis02-68	16	18	liu	liu	PROPN
ajis02-68	16	19	2001	2001	NUM
ajis02-68	16	20	)	)	PUNCT
ajis02-68	16	21	.	.	PUNCT
ajis02-68	17	1	it	it	PRON
ajis02-68	17	2	also	also	ADV
ajis02-68	17	3	served	serve	VERB
ajis02-68	17	4	as	as	ADP
ajis02-68	17	5	a	a	DET
ajis02-68	17	6	guideline	guideline	NOUN
ajis02-68	17	7	for	for	ADP
ajis02-68	17	8	building	build	VERB
ajis02-68	17	9	indexes	index	NOUN
ajis02-68	17	10	and	and	CCONJ
ajis02-68	17	11	views	view	NOUN
ajis02-68	17	12	or	or	CCONJ
ajis02-68	17	13	a	a	DET
ajis02-68	17	14	starting	starting	NOUN
ajis02-68	17	15	point	point	NOUN
ajis02-68	17	16	for	for	ADP
ajis02-68	17	17	structure	structure	NOUN
ajis02-68	17	18	-	-	PUNCT
ajis02-68	17	19	based	base	VERB
ajis02-68	17	20	document	document	NOUN
ajis02-68	17	21	clustering	clustering	NOUN
ajis02-68	17	22	based	base	VERB
ajis02-68	17	23	on	on	ADP
ajis02-68	17	24	approach	approach	NOUN
ajis02-68	17	25	proposed	propose	VERB
ajis02-68	17	26	by	by	ADP
ajis02-68	17	27	deutsch	deutsch	NOUN
ajis02-68	17	28	et	et	PROPN
ajis02-68	17	29	al	al	PROPN
ajis02-68	17	30	(	(	PUNCT
ajis02-68	17	31	1999	1999	NUM
ajis02-68	17	32	)	)	PUNCT
ajis02-68	17	33	that	that	PRON
ajis02-68	17	34	uses	use	VERB
ajis02-68	17	35	the	the	DET
ajis02-68	17	36	xml	xml	NOUN
ajis02-68	17	37	instance	instance	NOUN
ajis02-68	17	38	to	to	PART
ajis02-68	17	39	infer	infer	VERB
ajis02-68	17	40	a	a	DET
ajis02-68	17	41	relational	relational	ADJ
ajis02-68	17	42	schema	schema	NOUN
ajis02-68	17	43	.	.	PUNCT
ajis02-68	18	1	the	the	DET
ajis02-68	18	2	idea	idea	NOUN
ajis02-68	18	3	is	be	AUX
ajis02-68	18	4	to	to	PART
ajis02-68	18	5	find	find	VERB
ajis02-68	18	6	regularities	regularity	NOUN
ajis02-68	18	7	that	that	PRON
ajis02-68	18	8	may	may	AUX
ajis02-68	18	9	exist	exist	VERB
ajis02-68	18	10	in	in	ADP
ajis02-68	18	11	a	a	DET
ajis02-68	18	12	given	give	VERB
ajis02-68	18	13	xml	xml	NOUN
ajis02-68	18	14	data	datum	NOUN
ajis02-68	18	15	instance	instance	NOUN
ajis02-68	18	16	,	,	PUNCT
ajis02-68	18	17	and	and	CCONJ
ajis02-68	18	18	to	to	PART
ajis02-68	18	19	organise	organise	VERB
ajis02-68	18	20	the	the	DET
ajis02-68	18	21	storage	storage	NOUN
ajis02-68	18	22	base	base	NOUN
ajis02-68	18	23	on	on	ADP
ajis02-68	18	24	those	those	DET
ajis02-68	18	25	regularities	regularity	NOUN
ajis02-68	18	26	(	(	PUNCT
ajis02-68	18	27	deutsch	deutsch	NOUN
ajis02-68	18	28	et	et	NOUN
ajis02-68	18	29	al	al	PROPN
ajis02-68	18	30	1999	1999	NUM
ajis02-68	18	31	,	,	PUNCT
ajis02-68	18	32	cooper	cooper	PROPN
ajis02-68	18	33	et	et	PROPN
ajis02-68	18	34	al	al	PROPN
ajis02-68	18	35	2001	2001	NUM
ajis02-68	18	36	)	)	PUNCT
ajis02-68	18	37	.	.	PUNCT
ajis02-68	19	1	the	the	DET
ajis02-68	19	2	challenge	challenge	NOUN
ajis02-68	19	3	in	in	ADP
ajis02-68	19	4	any	any	DET
ajis02-68	19	5	storage	storage	NOUN
ajis02-68	19	6	schema	schema	NOUN
ajis02-68	19	7	is	be	AUX
ajis02-68	19	8	that	that	SCONJ
ajis02-68	19	9	it	it	PRON
ajis02-68	19	10	has	have	VERB
ajis02-68	19	11	to	to	PART
ajis02-68	19	12	be	be	AUX
ajis02-68	19	13	flexible	flexible	ADJ
ajis02-68	19	14	enough	enough	ADV
ajis02-68	19	15	to	to	PART
ajis02-68	19	16	accommodate	accommodate	VERB
ajis02-68	19	17	ajis	ajis	ADV
ajis02-68	19	18	vol	vol	NOUN
ajis02-68	19	19	13	13	NUM
ajis02-68	19	20	,	,	PUNCT
ajis02-68	19	21	no	no	INTJ
ajis02-68	19	22	.	.	NOUN
ajis02-68	19	23	1	1	NUM
ajis02-68	19	24	september	september	PROPN
ajis02-68	19	25	2005	2005	NUM
ajis02-68	19	26	151	151	NUM
ajis02-68	19	27	data	datum	NOUN
ajis02-68	19	28	,	,	PUNCT
ajis02-68	19	29	and	and	CCONJ
ajis02-68	19	30	efficient	efficient	ADJ
ajis02-68	19	31	as	as	ADP
ajis02-68	19	32	regular	regular	ADJ
ajis02-68	19	33	data	datum	NOUN
ajis02-68	19	34	storage	storage	NOUN
ajis02-68	19	35	.	.	PUNCT
ajis02-68	20	1	the	the	DET
ajis02-68	20	2	number	number	NOUN
ajis02-68	20	3	of	of	ADP
ajis02-68	20	4	accessible	accessible	ADJ
ajis02-68	20	5	xml	xml	NOUN
ajis02-68	20	6	documents	document	NOUN
ajis02-68	20	7	tends	tend	VERB
ajis02-68	20	8	to	to	PART
ajis02-68	20	9	grow	grow	VERB
ajis02-68	20	10	as	as	SCONJ
ajis02-68	20	11	more	more	ADJ
ajis02-68	20	12	and	and	CCONJ
ajis02-68	20	13	more	more	ADJ
ajis02-68	20	14	business	business	NOUN
ajis02-68	20	15	are	be	AUX
ajis02-68	20	16	storing	store	VERB
ajis02-68	20	17	and	and	CCONJ
ajis02-68	20	18	interchanging	interchanging	ADJ
ajis02-68	20	19	data	datum	NOUN
ajis02-68	20	20	between	between	ADP
ajis02-68	20	21	applications	application	NOUN
ajis02-68	20	22	using	use	VERB
ajis02-68	20	23	xml	xml	NOUN
ajis02-68	20	24	as	as	ADP
ajis02-68	20	25	a	a	DET
ajis02-68	20	26	common	common	ADJ
ajis02-68	20	27	format	format	NOUN
ajis02-68	20	28	.	.	PUNCT
ajis02-68	21	1	semi	semi	ADJ
ajis02-68	21	2	-	-	ADJ
ajis02-68	21	3	structured	structured	ADJ
ajis02-68	21	4	data	datum	NOUN
ajis02-68	21	5	representation	representation	NOUN
ajis02-68	21	6	we	we	PRON
ajis02-68	21	7	can	can	AUX
ajis02-68	21	8	represent	represent	VERB
ajis02-68	21	9	semi	semi	ADJ
ajis02-68	21	10	-	-	ADJ
ajis02-68	21	11	structured	structured	ADJ
ajis02-68	21	12	document	document	NOUN
ajis02-68	21	13	as	as	ADP
ajis02-68	21	14	a	a	DET
ajis02-68	21	15	graph	graph	NOUN
ajis02-68	21	16	or	or	CCONJ
ajis02-68	21	17	as	as	ADP
ajis02-68	21	18	a	a	DET
ajis02-68	21	19	tree	tree	NOUN
ajis02-68	21	20	.	.	PUNCT
ajis02-68	22	1	the	the	DET
ajis02-68	22	2	tree	tree	NOUN
ajis02-68	22	3	model	model	NOUN
ajis02-68	22	4	reflects	reflect	VERB
ajis02-68	22	5	nesting	nest	VERB
ajis02-68	22	6	of	of	ADP
ajis02-68	22	7	elements	element	NOUN
ajis02-68	22	8	within	within	ADP
ajis02-68	22	9	xml	xml	NOUN
ajis02-68	22	10	file	file	NOUN
ajis02-68	22	11	and	and	CCONJ
ajis02-68	22	12	treats	treat	VERB
ajis02-68	22	13	reference	reference	NOUN
ajis02-68	22	14	elements	element	NOUN
ajis02-68	22	15	(	(	PUNCT
ajis02-68	22	16	idref	idref	PROPN
ajis02-68	22	17	)	)	PUNCT
ajis02-68	22	18	as	as	ADP
ajis02-68	22	19	values	value	NOUN
ajis02-68	22	20	.	.	PUNCT
ajis02-68	23	1	the	the	DET
ajis02-68	23	2	graph	graph	NOUN
ajis02-68	23	3	model	model	NOUN
ajis02-68	23	4	resolves	resolve	NOUN
ajis02-68	23	5	semantics	semantic	NOUN
ajis02-68	23	6	of	of	ADP
ajis02-68	23	7	reference	reference	NOUN
ajis02-68	23	8	elements	element	NOUN
ajis02-68	23	9	and	and	CCONJ
ajis02-68	23	10	,	,	PUNCT
ajis02-68	23	11	thus	thus	ADV
ajis02-68	23	12	,	,	PUNCT
ajis02-68	23	13	allows	allow	VERB
ajis02-68	23	14	an	an	DET
ajis02-68	23	15	element	element	NOUN
ajis02-68	23	16	to	to	PART
ajis02-68	23	17	have	have	VERB
ajis02-68	23	18	multiple	multiple	ADJ
ajis02-68	23	19	parent	parent	NOUN
ajis02-68	23	20	elements	element	NOUN
ajis02-68	23	21	.	.	PUNCT
ajis02-68	24	1	when	when	SCONJ
ajis02-68	24	2	semi	semi	ADJ
ajis02-68	24	3	-	-	ADJ
ajis02-68	24	4	structured	structured	ADJ
ajis02-68	24	5	data	datum	NOUN
ajis02-68	24	6	is	be	AUX
ajis02-68	24	7	represent	represent	ADJ
ajis02-68	24	8	as	as	ADP
ajis02-68	24	9	a	a	DET
ajis02-68	24	10	label	label	NOUN
ajis02-68	24	11	,	,	PUNCT
ajis02-68	24	12	directed	direct	VERB
ajis02-68	24	13	,	,	PUNCT
ajis02-68	24	14	and	and	CCONJ
ajis02-68	24	15	possibly	possibly	ADV
ajis02-68	24	16	cyclic	cyclic	ADJ
ajis02-68	24	17	graph	graph	NOUN
ajis02-68	24	18	,	,	PUNCT
ajis02-68	24	19	the	the	DET
ajis02-68	24	20	vertices	vertex	NOUN
ajis02-68	24	21	of	of	ADP
ajis02-68	24	22	such	such	DET
ajis02-68	24	23	a	a	DET
ajis02-68	24	24	graph	graph	NOUN
ajis02-68	24	25	correspond	correspond	NOUN
ajis02-68	24	26	to	to	ADP
ajis02-68	24	27	objects	object	NOUN
ajis02-68	24	28	that	that	PRON
ajis02-68	24	29	are	be	AUX
ajis02-68	24	30	either	either	ADV
ajis02-68	24	31	treated	treat	VERB
ajis02-68	24	32	as	as	ADP
ajis02-68	24	33	containers	container	NOUN
ajis02-68	24	34	for	for	ADP
ajis02-68	24	35	some	some	DET
ajis02-68	24	36	other	other	ADJ
ajis02-68	24	37	objects	object	NOUN
ajis02-68	24	38	or	or	CCONJ
ajis02-68	24	39	associated	associate	VERB
ajis02-68	24	40	with	with	ADP
ajis02-68	24	41	atomic	atomic	ADJ
ajis02-68	24	42	values	value	NOUN
ajis02-68	24	43	(	(	PUNCT
ajis02-68	24	44	such	such	ADJ
ajis02-68	24	45	as	as	ADP
ajis02-68	24	46	text	text	NOUN
ajis02-68	24	47	,	,	PUNCT
ajis02-68	24	48	multimedia	multimedia	NOUN
ajis02-68	24	49	content	content	NOUN
ajis02-68	24	50	,	,	PUNCT
ajis02-68	24	51	etc	etc	X
ajis02-68	24	52	.	.	X
ajis02-68	24	53	)	)	PUNCT
ajis02-68	24	54	.	.	PUNCT
ajis02-68	25	1	edges	edge	NOUN
ajis02-68	25	2	of	of	ADP
ajis02-68	25	3	the	the	DET
ajis02-68	25	4	graph	graph	NOUN
ajis02-68	25	5	stand	stand	VERB
ajis02-68	25	6	for	for	ADP
ajis02-68	25	7	containment	containment	NOUN
ajis02-68	25	8	relationship	relationship	NOUN
ajis02-68	25	9	between	between	ADP
ajis02-68	25	10	nodes	node	NOUN
ajis02-68	25	11	and	and	CCONJ
ajis02-68	25	12	have	have	VERB
ajis02-68	25	13	object	object	NOUN
ajis02-68	25	14	types	type	NOUN
ajis02-68	25	15	as	as	ADP
ajis02-68	25	16	labels	label	NOUN
ajis02-68	25	17	.	.	PUNCT
ajis02-68	26	1	an	an	DET
ajis02-68	26	2	example	example	NOUN
ajis02-68	26	3	of	of	ADP
ajis02-68	26	4	such	such	DET
ajis02-68	26	5	a	a	DET
ajis02-68	26	6	model	model	NOUN
ajis02-68	26	7	is	be	AUX
ajis02-68	26	8	the	the	DET
ajis02-68	26	9	object	object	NOUN
ajis02-68	26	10	exchange	exchange	NOUN
ajis02-68	26	11	model	model	NOUN
ajis02-68	26	12	(	(	PUNCT
ajis02-68	26	13	oem	oem	PROPN
ajis02-68	26	14	)	)	PUNCT
ajis02-68	26	15	(	(	PUNCT
ajis02-68	26	16	papakonstantinou	papakonstantinou	NOUN
ajis02-68	26	17	et	et	NOUN
ajis02-68	26	18	al	al	PROPN
ajis02-68	26	19	1995	1995	NUM
ajis02-68	26	20	)	)	PUNCT
ajis02-68	26	21	,	,	PUNCT
ajis02-68	26	22	in	in	ADP
ajis02-68	26	23	this	this	DET
ajis02-68	26	24	model	model	NOUN
ajis02-68	26	25	,	,	PUNCT
ajis02-68	26	26	each	each	DET
ajis02-68	26	27	xml	xml	NOUN
ajis02-68	26	28	element	element	NOUN
ajis02-68	26	29	becomes	become	VERB
ajis02-68	26	30	an	an	DET
ajis02-68	26	31	edge	edge	NOUN
ajis02-68	26	32	(	(	PUNCT
ajis02-68	26	33	labelled	label	VERB
ajis02-68	26	34	with	with	ADP
ajis02-68	26	35	the	the	DET
ajis02-68	26	36	tag	tag	NOUN
ajis02-68	26	37	name	name	NOUN
ajis02-68	26	38	)	)	PUNCT
ajis02-68	26	39	and	and	CCONJ
ajis02-68	26	40	directed	direct	VERB
ajis02-68	26	41	towards	towards	ADP
ajis02-68	26	42	an	an	DET
ajis02-68	26	43	individual	individual	ADJ
ajis02-68	26	44	node	node	NOUN
ajis02-68	26	45	.	.	PUNCT
ajis02-68	27	1	each	each	DET
ajis02-68	27	2	node	node	NOUN
ajis02-68	27	3	corresponds	correspond	VERB
ajis02-68	27	4	to	to	ADP
ajis02-68	27	5	an	an	DET
ajis02-68	27	6	xml	xml	NOUN
ajis02-68	27	7	element	element	NOUN
ajis02-68	27	8	and	and	CCONJ
ajis02-68	27	9	has	have	VERB
ajis02-68	27	10	element	element	NOUN
ajis02-68	27	11	’s	’s	PART
ajis02-68	27	12	i	i	NOUN
ajis02-68	27	13	d	d	PROPN
ajis02-68	27	14	as	as	ADP
ajis02-68	27	15	its	its	PRON
ajis02-68	27	16	label	label	NOUN
ajis02-68	27	17	.	.	PUNCT
ajis02-68	28	1	each	each	DET
ajis02-68	28	2	edge	edge	NOUN
ajis02-68	28	3	in	in	ADP
ajis02-68	28	4	the	the	DET
ajis02-68	28	5	xml	xml	NOUN
ajis02-68	28	6	data	data	NOUN
ajis02-68	28	7	graph	graph	NOUN
ajis02-68	28	8	has	have	VERB
ajis02-68	28	9	a	a	DET
ajis02-68	28	10	label	label	NOUN
ajis02-68	28	11	and	and	CCONJ
ajis02-68	28	12	a	a	DET
ajis02-68	28	13	target	target	NOUN
ajis02-68	28	14	,	,	PUNCT
ajis02-68	28	15	where	where	SCONJ
ajis02-68	28	16	the	the	DET
ajis02-68	28	17	target	target	NOUN
ajis02-68	28	18	is	be	AUX
ajis02-68	28	19	either	either	CCONJ
ajis02-68	28	20	a	a	DET
ajis02-68	28	21	node	node	NOUN
ajis02-68	28	22	representing	represent	VERB
ajis02-68	28	23	a	a	DET
ajis02-68	28	24	scalar	scalar	ADJ
ajis02-68	28	25	data	data	NOUN
ajis02-68	28	26	value	value	NOUN
ajis02-68	28	27	(	(	PUNCT
ajis02-68	28	28	e.g.	e.g.	ADV
ajis02-68	28	29	a	a	DET
ajis02-68	28	30	string	string	NOUN
ajis02-68	28	31	or	or	CCONJ
ajis02-68	28	32	integer	integer	NOUN
ajis02-68	28	33	)	)	PUNCT
ajis02-68	28	34	or	or	CCONJ
ajis02-68	28	35	a	a	DET
ajis02-68	28	36	reference	reference	NOUN
ajis02-68	28	37	to	to	ADP
ajis02-68	28	38	an	an	DET
ajis02-68	28	39	element	element	NOUN
ajis02-68	28	40	node	node	NOUN
ajis02-68	28	41	in	in	ADP
ajis02-68	28	42	the	the	DET
ajis02-68	28	43	document	document	NOUN
ajis02-68	28	44	via	via	ADP
ajis02-68	28	45	its	its	PRON
ajis02-68	28	46	i	i	PROPN
ajis02-68	28	47	d.	d.	NOUN
ajis02-68	28	48	the	the	DET
ajis02-68	28	49	edge	edge	NOUN
ajis02-68	28	50	belongs	belong	VERB
ajis02-68	28	51	to	to	ADP
ajis02-68	28	52	a	a	DET
ajis02-68	28	53	class	class	NOUN
ajis02-68	28	54	,	,	PUNCT
ajis02-68	28	55	which	which	PRON
ajis02-68	28	56	can	can	AUX
ajis02-68	28	57	be	be	AUX
ajis02-68	28	58	one	one	NUM
ajis02-68	28	59	of	of	ADP
ajis02-68	28	60	sub	sub	NOUN
ajis02-68	28	61	-	-	ADJ
ajis02-68	28	62	element	element	ADJ
ajis02-68	28	63	,	,	PUNCT
ajis02-68	28	64	attribute	attribute	NOUN
ajis02-68	28	65	,	,	PUNCT
ajis02-68	28	66	or	or	CCONJ
ajis02-68	28	67	idref	idref	PROPN
ajis02-68	28	68	(	(	PUNCT
ajis02-68	28	69	i	i	NOUN
ajis02-68	28	70	d	d	PROPN
ajis02-68	28	71	reference	reference	NOUN
ajis02-68	28	72	)	)	PUNCT
ajis02-68	28	73	.	.	PUNCT
ajis02-68	29	1	both	both	PRON
ajis02-68	29	2	idref	idref	ADJ
ajis02-68	29	3	and	and	CCONJ
ajis02-68	29	4	sub	sub	ADJ
ajis02-68	29	5	-	-	ADJ
ajis02-68	29	6	element	element	ADJ
ajis02-68	29	7	edges	edge	NOUN
ajis02-68	29	8	always	always	ADV
ajis02-68	29	9	direct	direct	ADJ
ajis02-68	29	10	towards	towards	ADP
ajis02-68	29	11	element	element	NOUN
ajis02-68	29	12	nodes	node	NOUN
ajis02-68	29	13	in	in	ADP
ajis02-68	29	14	the	the	DET
ajis02-68	29	15	graph	graph	NOUN
ajis02-68	29	16	;	;	PUNCT
ajis02-68	29	17	attribute	attribute	NOUN
ajis02-68	29	18	edges	edge	NOUN
ajis02-68	29	19	.	.	PUNCT
ajis02-68	30	1	every	every	DET
ajis02-68	30	2	element	element	NOUN
ajis02-68	30	3	node	node	NOUN
ajis02-68	30	4	has	have	VERB
ajis02-68	30	5	precisely	precisely	ADV
ajis02-68	30	6	one	one	NUM
ajis02-68	30	7	incoming	incoming	ADJ
ajis02-68	30	8	edge	edge	NOUN
ajis02-68	30	9	of	of	ADP
ajis02-68	30	10	sub	sub	ADJ
ajis02-68	30	11	-	-	ADJ
ajis02-68	30	12	element	element	ADJ
ajis02-68	30	13	type	type	NOUN
ajis02-68	30	14	and	and	CCONJ
ajis02-68	30	15	any	any	DET
ajis02-68	30	16	other	other	ADJ
ajis02-68	30	17	incoming	incoming	ADJ
ajis02-68	30	18	edges	edge	NOUN
ajis02-68	30	19	must	must	AUX
ajis02-68	30	20	be	be	AUX
ajis02-68	30	21	of	of	ADP
ajis02-68	30	22	idref	idref	ADJ
ajis02-68	30	23	type	type	NOUN
ajis02-68	30	24	.	.	PUNCT
ajis02-68	31	1	if	if	SCONJ
ajis02-68	31	2	all	all	DET
ajis02-68	31	3	idref	idref	ADJ
ajis02-68	31	4	edges	edge	NOUN
ajis02-68	31	5	of	of	ADP
ajis02-68	31	6	an	an	DET
ajis02-68	31	7	xml	xml	NOUN
ajis02-68	31	8	data	data	NOUN
ajis02-68	31	9	graph	graph	NOUN
ajis02-68	31	10	are	be	AUX
ajis02-68	31	11	converted	convert	VERB
ajis02-68	31	12	into	into	ADP
ajis02-68	31	13	attribute	attribute	NOUN
ajis02-68	31	14	edges	edge	NOUN
ajis02-68	31	15	(	(	PUNCT
ajis02-68	31	16	with	with	ADP
ajis02-68	31	17	destination	destination	NOUN
ajis02-68	31	18	value	value	NOUN
ajis02-68	31	19	equal	equal	ADJ
ajis02-68	31	20	to	to	ADP
ajis02-68	31	21	the	the	DET
ajis02-68	31	22	target	target	NOUN
ajis02-68	31	23	node	node	PROPN
ajis02-68	31	24	i	i	PROPN
ajis02-68	31	25	d	d	PROPN
ajis02-68	31	26	)	)	PUNCT
ajis02-68	31	27	,	,	PUNCT
ajis02-68	31	28	the	the	DET
ajis02-68	31	29	data	data	NOUN
ajis02-68	31	30	graph	graph	NOUN
ajis02-68	31	31	can	can	AUX
ajis02-68	31	32	be	be	AUX
ajis02-68	31	33	mapped	map	VERB
ajis02-68	31	34	into	into	ADP
ajis02-68	31	35	a	a	DET
ajis02-68	31	36	tree	tree	NOUN
ajis02-68	31	37	.	.	PUNCT
ajis02-68	32	1	each	each	DET
ajis02-68	32	2	element	element	NOUN
ajis02-68	32	3	of	of	ADP
ajis02-68	32	4	the	the	DET
ajis02-68	32	5	document	document	NOUN
ajis02-68	32	6	forms	form	VERB
ajis02-68	32	7	a	a	DET
ajis02-68	32	8	node	node	NOUN
ajis02-68	32	9	in	in	ADP
ajis02-68	32	10	the	the	DET
ajis02-68	32	11	tree	tree	NOUN
ajis02-68	32	12	labelled	label	VERB
ajis02-68	32	13	with	with	ADP
ajis02-68	32	14	the	the	DET
ajis02-68	32	15	element	element	NOUN
ajis02-68	32	16	type	type	NOUN
ajis02-68	32	17	(	(	PUNCT
ajis02-68	32	18	tag	tag	NOUN
ajis02-68	32	19	name	name	NOUN
ajis02-68	32	20	)	)	PUNCT
ajis02-68	32	21	and	and	CCONJ
ajis02-68	32	22	value	value	NOUN
ajis02-68	32	23	.	.	PUNCT
ajis02-68	33	1	the	the	DET
ajis02-68	33	2	edges	edge	NOUN
ajis02-68	33	3	of	of	ADP
ajis02-68	33	4	the	the	DET
ajis02-68	33	5	tree	tree	NOUN
ajis02-68	33	6	stand	stand	VERB
ajis02-68	33	7	for	for	ADP
ajis02-68	33	8	parent	parent	NOUN
ajis02-68	33	9	-	-	PUNCT
ajis02-68	33	10	child	child	NOUN
ajis02-68	33	11	(	(	PUNCT
ajis02-68	33	12	containment	containment	NOUN
ajis02-68	33	13	)	)	PUNCT
ajis02-68	33	14	relationship	relationship	NOUN
ajis02-68	33	15	between	between	ADP
ajis02-68	33	16	the	the	DET
ajis02-68	33	17	elements	element	NOUN
ajis02-68	33	18	.	.	PUNCT
ajis02-68	34	1	all	all	PRON
ajis02-68	34	2	sub	sub	NOUN
ajis02-68	34	3	-	-	NOUN
ajis02-68	34	4	elements	element	NOUN
ajis02-68	34	5	nested	nest	VERB
ajis02-68	34	6	within	within	ADP
ajis02-68	34	7	an	an	DET
ajis02-68	34	8	element	element	NOUN
ajis02-68	34	9	appear	appear	VERB
ajis02-68	34	10	in	in	ADP
ajis02-68	34	11	the	the	DET
ajis02-68	34	12	tree	tree	NOUN
ajis02-68	34	13	as	as	SCONJ
ajis02-68	34	14	the	the	DET
ajis02-68	34	15	child	child	NOUN
ajis02-68	34	16	nodes	node	NOUN
ajis02-68	34	17	directly	directly	ADV
ajis02-68	34	18	connected	connect	VERB
ajis02-68	34	19	with	with	ADP
ajis02-68	34	20	the	the	DET
ajis02-68	34	21	edges	edge	NOUN
ajis02-68	34	22	to	to	ADP
ajis02-68	34	23	a	a	DET
ajis02-68	34	24	parent	parent	NOUN
ajis02-68	34	25	node	node	NOUN
ajis02-68	34	26	.	.	PUNCT
ajis02-68	35	1	the	the	DET
ajis02-68	35	2	attribute	attribute	NOUN
ajis02-68	35	3	in	in	ADP
ajis02-68	35	4	the	the	DET
ajis02-68	35	5	elements	element	NOUN
ajis02-68	35	6	represents	represent	VERB
ajis02-68	35	7	in	in	ADP
ajis02-68	35	8	a	a	DET
ajis02-68	35	9	nested	nested	ADJ
ajis02-68	35	10	sub	sub	NOUN
ajis02-68	35	11	-	-	NOUN
ajis02-68	35	12	elements	element	NOUN
ajis02-68	35	13	and	and	CCONJ
ajis02-68	35	14	form	form	VERB
ajis02-68	35	15	additional	additional	ADJ
ajis02-68	35	16	nodes	node	NOUN
ajis02-68	35	17	in	in	ADP
ajis02-68	35	18	the	the	DET
ajis02-68	35	19	tree	tree	NOUN
ajis02-68	35	20	,	,	PUNCT
ajis02-68	35	21	emanating	emanate	VERB
ajis02-68	35	22	from	from	ADP
ajis02-68	35	23	the	the	DET
ajis02-68	35	24	associated	associated	ADJ
ajis02-68	35	25	parent	parent	NOUN
ajis02-68	35	26	nodes	nod	VERB
ajis02-68	35	27	.	.	PUNCT
ajis02-68	36	1	pattern	pattern	NOUN
ajis02-68	36	2	specification	specification	NOUN
ajis02-68	36	3	language	language	NOUN
ajis02-68	36	4	a	a	DET
ajis02-68	36	5	number	number	NOUN
ajis02-68	36	6	of	of	ADP
ajis02-68	36	7	languages	language	NOUN
ajis02-68	36	8	have	have	AUX
ajis02-68	36	9	been	be	AUX
ajis02-68	36	10	proposed	propose	VERB
ajis02-68	36	11	for	for	ADP
ajis02-68	36	12	querying	query	VERB
ajis02-68	36	13	semi	semi	ADJ
ajis02-68	36	14	-	-	ADJ
ajis02-68	36	15	structured	structured	ADJ
ajis02-68	36	16	and	and	CCONJ
ajis02-68	36	17	xml	xml	NOUN
ajis02-68	36	18	databases	database	NOUN
ajis02-68	36	19	,	,	PUNCT
ajis02-68	36	20	which	which	PRON
ajis02-68	36	21	includes	include	VERB
ajis02-68	36	22	following	follow	VERB
ajis02-68	36	23	xquery	xquery	PROPN
ajis02-68	36	24	,	,	PUNCT
ajis02-68	36	25	lorel	lorel	NOUN
ajis02-68	36	26	,	,	PUNCT
ajis02-68	36	27	xml	xml	NOUN
ajis02-68	36	28	-	-	PUNCT
ajis02-68	36	29	ql	ql	NOUN
ajis02-68	36	30	,	,	PUNCT
ajis02-68	36	31	and	and	CCONJ
ajis02-68	36	32	unql	unql	NOUN
ajis02-68	36	33	.	.	PUNCT
ajis02-68	37	1	a	a	DET
ajis02-68	37	2	common	common	ADJ
ajis02-68	37	3	characteristic	characteristic	NOUN
ajis02-68	37	4	of	of	ADP
ajis02-68	37	5	all	all	DET
ajis02-68	37	6	existing	exist	VERB
ajis02-68	37	7	language	language	NOUN
ajis02-68	37	8	proposals	proposal	NOUN
ajis02-68	37	9	is	be	AUX
ajis02-68	37	10	the	the	DET
ajis02-68	37	11	existence	existence	NOUN
ajis02-68	37	12	of	of	ADP
ajis02-68	37	13	a	a	DET
ajis02-68	37	14	pattern	pattern	NOUN
ajis02-68	37	15	specification	specification	NOUN
ajis02-68	37	16	language	language	NOUN
ajis02-68	37	17	e.g.	e.g.	ADV
ajis02-68	37	18	xpath	xpath	NOUN
ajis02-68	37	19	,	,	PUNCT
ajis02-68	37	20	which	which	PRON
ajis02-68	37	21	built	build	VERB
ajis02-68	37	22	around	around	ADP
ajis02-68	37	23	path	path	NOUN
ajis02-68	37	24	and	and	CCONJ
ajis02-68	37	25	sub	sub	ADJ
ajis02-68	37	26	-	-	ADJ
ajis02-68	37	27	tree	tree	ADJ
ajis02-68	37	28	expressions	expression	NOUN
ajis02-68	37	29	.	.	PUNCT
ajis02-68	38	1	these	these	DET
ajis02-68	38	2	expressions	expression	NOUN
ajis02-68	38	3	replace	replace	VERB
ajis02-68	38	4	the	the	DET
ajis02-68	38	5	traditional	traditional	ADJ
ajis02-68	38	6	sql	sql	NOUN
ajis02-68	38	7	form	form	NOUN
ajis02-68	38	8	clause	clause	NOUN
ajis02-68	38	9	and	and	CCONJ
ajis02-68	38	10	enable	enable	ADJ
ajis02-68	38	11	selections	selection	NOUN
ajis02-68	38	12	based	base	VERB
ajis02-68	38	13	on	on	ADP
ajis02-68	38	14	value	value	NOUN
ajis02-68	38	15	predicates	predicate	NOUN
ajis02-68	38	16	as	as	ADV
ajis02-68	38	17	well	well	ADV
ajis02-68	38	18	as	as	ADP
ajis02-68	38	19	path	path	NOUN
ajis02-68	38	20	navigation	navigation	NOUN
ajis02-68	38	21	and	and	CCONJ
ajis02-68	38	22	branching	branch	VERB
ajis02-68	38	23	through	through	ADP
ajis02-68	38	24	the	the	DET
ajis02-68	38	25	xml	xml	NOUN
ajis02-68	38	26	data	data	NOUN
ajis02-68	38	27	graph	graph	NOUN
ajis02-68	38	28	in	in	ADP
ajis02-68	38	29	order	order	NOUN
ajis02-68	38	30	to	to	PART
ajis02-68	38	31	reach	reach	VERB
ajis02-68	38	32	relevant	relevant	ADJ
ajis02-68	38	33	data	datum	NOUN
ajis02-68	38	34	elements	element	NOUN
ajis02-68	38	35	.	.	PUNCT
ajis02-68	39	1	path	path	NOUN
ajis02-68	39	2	queries	query	NOUN
ajis02-68	39	3	are	be	AUX
ajis02-68	39	4	popularised	popularise	VERB
ajis02-68	39	5	in	in	ADP
ajis02-68	39	6	the	the	DET
ajis02-68	39	7	context	context	NOUN
ajis02-68	39	8	of	of	ADP
ajis02-68	39	9	object	object	NOUN
ajis02-68	39	10	-	-	PUNCT
ajis02-68	39	11	oriented	orient	VERB
ajis02-68	39	12	databases	database	NOUN
ajis02-68	39	13	,	,	PUNCT
ajis02-68	39	14	while	while	SCONJ
ajis02-68	39	15	the	the	DET
ajis02-68	39	16	pattern	pattern	NOUN
ajis02-68	39	17	specification	specification	NOUN
ajis02-68	39	18	language	language	NOUN
ajis02-68	39	19	proposed	propose	VERB
ajis02-68	39	20	for	for	ADP
ajis02-68	39	21	xml	xml	NOUN
ajis02-68	39	22	data	datum	NOUN
ajis02-68	39	23	are	be	AUX
ajis02-68	39	24	substantially	substantially	ADV
ajis02-68	39	25	more	more	ADV
ajis02-68	39	26	complex	complex	ADJ
ajis02-68	39	27	.	.	PUNCT
ajis02-68	40	1	in	in	ADP
ajis02-68	40	2	particular	particular	ADJ
ajis02-68	40	3	,	,	PUNCT
ajis02-68	40	4	the	the	DET
ajis02-68	40	5	xpath	xpath	PROPN
ajis02-68	40	6	language	language	PROPN
ajis02-68	40	7	,	,	PUNCT
ajis02-68	40	8	xquery	xquery	NOUN
ajis02-68	40	9	,	,	PUNCT
ajis02-68	40	10	and	and	CCONJ
ajis02-68	40	11	xslt	xslt	PROPN
ajis02-68	40	12	,	,	PUNCT
ajis02-68	40	13	is	be	AUX
ajis02-68	40	14	the	the	DET
ajis02-68	40	15	dominant	dominant	ADJ
ajis02-68	40	16	w3c	w3c	NOUN
ajis02-68	40	17	language	language	NOUN
ajis02-68	40	18	proposals	proposal	NOUN
ajis02-68	40	19	for	for	ADP
ajis02-68	40	20	xml	xml	NOUN
ajis02-68	40	21	querying	querying	NOUN
ajis02-68	40	22	and	and	CCONJ
ajis02-68	40	23	transformation	transformation	NOUN
ajis02-68	40	24	,	,	PUNCT
ajis02-68	40	25	which	which	PRON
ajis02-68	40	26	allows	allow	VERB
ajis02-68	40	27	branching	branch	VERB
ajis02-68	40	28	of	of	ADP
ajis02-68	40	29	other	other	ADJ
ajis02-68	40	30	regular	regular	ADJ
ajis02-68	40	31	path	path	NOUN
ajis02-68	40	32	expression	expression	NOUN
ajis02-68	40	33	to	to	PART
ajis02-68	40	34	enable	enable	VERB
ajis02-68	40	35	queries	query	NOUN
ajis02-68	40	36	navigation	navigation	NOUN
ajis02-68	40	37	along	along	ADP
ajis02-68	40	38	the	the	DET
ajis02-68	40	39	paths	path	NOUN
ajis02-68	40	40	of	of	ADP
ajis02-68	40	41	data	datum	NOUN
ajis02-68	40	42	that	that	PRON
ajis02-68	40	43	uses	use	VERB
ajis02-68	40	44	label	label	NOUN
ajis02-68	40	45	names	name	NOUN
ajis02-68	40	46	,	,	PUNCT
ajis02-68	40	47	wild	wild	ADJ
ajis02-68	40	48	cards	card	NOUN
ajis02-68	40	49	,	,	PUNCT
ajis02-68	40	50	value	value	NOUN
ajis02-68	40	51	predicates	predicate	NOUN
ajis02-68	40	52	and	and	CCONJ
ajis02-68	40	53	branching	branch	VERB
ajis02-68	40	54	predications	predication	NOUN
ajis02-68	40	55	on	on	ADP
ajis02-68	40	56	the	the	DET
ajis02-68	40	57	existence	existence	NOUN
ajis02-68	40	58	of	of	ADP
ajis02-68	40	59	specific	specific	ADJ
ajis02-68	40	60	product	product	NOUN
ajis02-68	40	61	paths	path	NOUN
ajis02-68	40	62	.	.	PUNCT
ajis02-68	41	1	the	the	DET
ajis02-68	41	2	key	key	ADJ
ajis02-68	41	3	idea	idea	NOUN
ajis02-68	41	4	underlying	underlie	VERB
ajis02-68	41	5	the	the	DET
ajis02-68	41	6	implementation	implementation	NOUN
ajis02-68	41	7	of	of	ADP
ajis02-68	41	8	the	the	DET
ajis02-68	41	9	existing	exist	VERB
ajis02-68	41	10	join	join	NOUN
ajis02-68	41	11	algorithms	algorithms	NOUN
ajis02-68	41	12	is	be	AUX
ajis02-68	41	13	the	the	DET
ajis02-68	41	14	decomposition	decomposition	NOUN
ajis02-68	41	15	of	of	ADP
ajis02-68	41	16	the	the	DET
ajis02-68	41	17	original	original	ADJ
ajis02-68	41	18	query	query	NOUN
ajis02-68	41	19	path	path	NOUN
ajis02-68	41	20	expression	expression	NOUN
ajis02-68	41	21	into	into	ADP
ajis02-68	41	22	a	a	DET
ajis02-68	41	23	set	set	NOUN
ajis02-68	41	24	of	of	ADP
ajis02-68	41	25	simple	simple	ADJ
ajis02-68	41	26	(	(	PUNCT
ajis02-68	41	27	binary	binary	ADJ
ajis02-68	41	28	)	)	PUNCT
ajis02-68	41	29	path	path	NOUN
ajis02-68	41	30	ajis	ajis	ADV
ajis02-68	41	31	vol	vol	VERB
ajis02-68	41	32	13	13	NUM
ajis02-68	41	33	,	,	PUNCT
ajis02-68	41	34	no	no	INTJ
ajis02-68	41	35	.	.	NOUN
ajis02-68	41	36	1	1	NUM
ajis02-68	41	37	september	september	PROPN
ajis02-68	41	38	2005	2005	NUM
ajis02-68	41	39	152	152	NUM
ajis02-68	41	40	expressions	expression	NOUN
ajis02-68	41	41	.	.	PUNCT
ajis02-68	42	1	each	each	DET
ajis02-68	42	2	binary	binary	ADJ
ajis02-68	42	3	expression	expression	NOUN
ajis02-68	42	4	produces	produce	VERB
ajis02-68	42	5	an	an	DET
ajis02-68	42	6	intermediate	intermediate	ADJ
ajis02-68	42	7	join	join	NOUN
ajis02-68	42	8	result	result	NOUN
ajis02-68	42	9	,	,	PUNCT
ajis02-68	42	10	which	which	PRON
ajis02-68	42	11	is	be	AUX
ajis02-68	42	12	used	use	VERB
ajis02-68	42	13	on	on	ADP
ajis02-68	42	14	the	the	DET
ajis02-68	42	15	subsequent	subsequent	ADJ
ajis02-68	42	16	stage	stage	NOUN
ajis02-68	42	17	.	.	PUNCT
ajis02-68	43	1	the	the	DET
ajis02-68	43	2	xiss	xiss	PROPN
ajis02-68	43	3	system	system	NOUN
ajis02-68	43	4	introduces	introduce	VERB
ajis02-68	43	5	three	three	NUM
ajis02-68	43	6	join	join	NOUN
ajis02-68	43	7	algorithms	algorithm	NOUN
ajis02-68	43	8	:	:	PUNCT
ajis02-68	43	9	element	element	NOUN
ajis02-68	43	10	-	-	PUNCT
ajis02-68	43	11	attribute	attribute	NOUN
ajis02-68	43	12	(	(	PUNCT
ajis02-68	43	13	ea	ea	NOUN
ajis02-68	43	14	-	-	NOUN
ajis02-68	43	15	join	join	NOUN
ajis02-68	43	16	)	)	PUNCT
ajis02-68	43	17	,	,	PUNCT
ajis02-68	43	18	element	element	NOUN
ajis02-68	43	19	-	-	PUNCT
ajis02-68	43	20	element	element	NOUN
ajis02-68	43	21	(	(	PUNCT
ajis02-68	43	22	ee	ee	NOUN
ajis02-68	43	23	-	-	PUNCT
ajis02-68	43	24	join	join	NOUN
ajis02-68	43	25	)	)	PUNCT
ajis02-68	43	26	,	,	PUNCT
ajis02-68	43	27	and	and	CCONJ
ajis02-68	43	28	kleene	kleene	NOUN
ajis02-68	43	29	-	-	PUNCT
ajis02-68	43	30	closure	closure	NOUN
ajis02-68	43	31	(	(	PUNCT
ajis02-68	43	32	kc	kc	NOUN
ajis02-68	43	33	-	-	PUNCT
ajis02-68	43	34	join	join	NOUN
ajis02-68	43	35	)	)	PUNCT
ajis02-68	43	36	.	.	PUNCT
ajis02-68	44	1	the	the	DET
ajis02-68	44	2	element	element	NOUN
ajis02-68	44	3	-	-	PUNCT
ajis02-68	44	4	attribute	attribute	NOUN
ajis02-68	44	5	algorithm	algorithm	NOUN
ajis02-68	44	6	joins	join	VERB
ajis02-68	44	7	two	two	NUM
ajis02-68	44	8	intermediate	intermediate	ADJ
ajis02-68	44	9	results	result	NOUN
ajis02-68	44	10	from	from	ADP
ajis02-68	44	11	sub	sub	NOUN
ajis02-68	44	12	-	-	NOUN
ajis02-68	44	13	expressions	expression	NOUN
ajis02-68	44	14	,	,	PUNCT
ajis02-68	44	15	which	which	PRON
ajis02-68	44	16	are	be	AUX
ajis02-68	44	17	a	a	DET
ajis02-68	44	18	list	list	NOUN
ajis02-68	44	19	of	of	ADP
ajis02-68	44	20	elements	element	NOUN
ajis02-68	44	21	and	and	CCONJ
ajis02-68	44	22	a	a	DET
ajis02-68	44	23	list	list	NOUN
ajis02-68	44	24	of	of	ADP
ajis02-68	44	25	attributes	attribute	NOUN
ajis02-68	44	26	.	.	PUNCT
ajis02-68	45	1	the	the	DET
ajis02-68	45	2	element	element	NOUN
ajis02-68	45	3	-	-	PUNCT
ajis02-68	45	4	element	element	NOUN
ajis02-68	45	5	algorithm	algorithm	NOUN
ajis02-68	45	6	joins	join	VERB
ajis02-68	45	7	two	two	NUM
ajis02-68	45	8	lists	list	NOUN
ajis02-68	45	9	of	of	ADP
ajis02-68	45	10	elements	element	NOUN
ajis02-68	45	11	.	.	PUNCT
ajis02-68	46	1	the	the	DET
ajis02-68	46	2	principal	principal	ADJ
ajis02-68	46	3	difference	difference	NOUN
ajis02-68	46	4	between	between	ADP
ajis02-68	46	5	these	these	DET
ajis02-68	46	6	algorithms	algorithm	NOUN
ajis02-68	46	7	is	be	AUX
ajis02-68	46	8	that	that	SCONJ
ajis02-68	46	9	the	the	DET
ajis02-68	46	10	latter	latter	ADJ
ajis02-68	46	11	one	one	NUM
ajis02-68	46	12	checks	check	NOUN
ajis02-68	46	13	ancestordescendant	ancestordescendant	ADJ
ajis02-68	46	14	relationship	relationship	NOUN
ajis02-68	46	15	between	between	ADP
ajis02-68	46	16	each	each	DET
ajis02-68	46	17	pair	pair	NOUN
ajis02-68	46	18	of	of	ADP
ajis02-68	46	19	the	the	DET
ajis02-68	46	20	input	input	NOUN
ajis02-68	46	21	lists	list	NOUN
ajis02-68	46	22	while	while	SCONJ
ajis02-68	46	23	the	the	DET
ajis02-68	46	24	former	former	ADJ
ajis02-68	46	25	one	one	NUM
ajis02-68	46	26	tests	test	VERB
ajis02-68	46	27	parent	parent	NOUN
ajis02-68	46	28	-	-	PUNCT
ajis02-68	46	29	child	child	NOUN
ajis02-68	46	30	relationship	relationship	NOUN
ajis02-68	46	31	.	.	PUNCT
ajis02-68	47	1	the	the	DET
ajis02-68	47	2	kleene	kleene	NOUN
ajis02-68	47	3	-	-	PUNCT
ajis02-68	47	4	closure	closure	NOUN
ajis02-68	47	5	algorithms	algorithm	NOUN
ajis02-68	47	6	iteratively	iteratively	ADV
ajis02-68	47	7	uses	use	VERB
ajis02-68	47	8	element	element	NOUN
ajis02-68	47	9	-	-	PUNCT
ajis02-68	47	10	element	element	NOUN
ajis02-68	47	11	algorithm	algorithm	NOUN
ajis02-68	47	12	to	to	PART
ajis02-68	47	13	compute	compute	VERB
ajis02-68	47	14	closure	closure	NOUN
ajis02-68	47	15	of	of	ADP
ajis02-68	47	16	the	the	DET
ajis02-68	47	17	expression	expression	NOUN
ajis02-68	47	18	.	.	PUNCT
ajis02-68	48	1	it	it	PRON
ajis02-68	48	2	repeatedly	repeatedly	ADV
ajis02-68	48	3	applies	apply	VERB
ajis02-68	48	4	ee	ee	PROPN
ajis02-68	48	5	-	-	PUNCT
ajis02-68	48	6	join	join	NOUN
ajis02-68	48	7	to	to	ADP
ajis02-68	48	8	the	the	DET
ajis02-68	48	9	result	result	NOUN
ajis02-68	48	10	from	from	ADP
ajis02-68	48	11	the	the	DET
ajis02-68	48	12	previous	previous	ADJ
ajis02-68	48	13	stage	stage	NOUN
ajis02-68	48	14	of	of	ADP
ajis02-68	48	15	iteration	iteration	NOUN
ajis02-68	48	16	.	.	PUNCT
ajis02-68	49	1	both	both	DET
ajis02-68	49	2	ea	ea	NOUN
ajis02-68	49	3	-	-	NOUN
ajis02-68	49	4	join	join	VERB
ajis02-68	49	5	and	and	CCONJ
ajis02-68	49	6	ee	ee	NOUN
ajis02-68	49	7	-	-	PUNCT
ajis02-68	49	8	join	join	VERB
ajis02-68	49	9	algorithms	algorithm	NOUN
ajis02-68	49	10	have	have	VERB
ajis02-68	49	11	a	a	DET
ajis02-68	49	12	loop	loop	NOUN
ajis02-68	49	13	over	over	ADP
ajis02-68	49	14	one	one	NUM
ajis02-68	49	15	input	input	NOUN
ajis02-68	49	16	list	list	NOUN
ajis02-68	49	17	nested	nest	VERB
ajis02-68	49	18	into	into	ADP
ajis02-68	49	19	a	a	DET
ajis02-68	49	20	loop	loop	NOUN
ajis02-68	49	21	over	over	ADP
ajis02-68	49	22	another	another	DET
ajis02-68	49	23	list	list	NOUN
ajis02-68	49	24	and	and	CCONJ
ajis02-68	49	25	,	,	PUNCT
ajis02-68	49	26	therefore	therefore	ADV
ajis02-68	49	27	,	,	PUNCT
ajis02-68	49	28	have	have	VERB
ajis02-68	49	29	time	time	NOUN
ajis02-68	49	30	complexity	complexity	NOUN
ajis02-68	49	31	o(|e1|·|e2|	o(|e1|·|e2|	NOUN
ajis02-68	49	32	)	)	PUNCT
ajis02-68	49	33	,	,	PUNCT
ajis02-68	49	34	which	which	PRON
ajis02-68	49	35	is	be	AUX
ajis02-68	49	36	quadratic	quadratic	ADJ
ajis02-68	49	37	in	in	ADP
ajis02-68	49	38	the	the	DET
ajis02-68	49	39	size	size	NOUN
ajis02-68	49	40	of	of	ADP
ajis02-68	49	41	the	the	DET
ajis02-68	49	42	input	input	NOUN
ajis02-68	49	43	lists	list	NOUN
ajis02-68	49	44	.	.	PUNCT
ajis02-68	50	1	as	as	SCONJ
ajis02-68	50	2	kc	kc	PROPN
ajis02-68	50	3	-	-	PUNCT
ajis02-68	50	4	join	join	PROPN
ajis02-68	50	5	depends	depend	VERB
ajis02-68	50	6	upon	upon	SCONJ
ajis02-68	50	7	eejoin	eejoin	NOUN
ajis02-68	50	8	,	,	PUNCT
ajis02-68	50	9	it	it	PRON
ajis02-68	50	10	has	have	VERB
ajis02-68	50	11	quadratic	quadratic	ADJ
ajis02-68	50	12	time	time	NOUN
ajis02-68	50	13	complexity	complexity	NOUN
ajis02-68	50	14	either	either	ADV
ajis02-68	50	15	.	.	PUNCT
ajis02-68	51	1	however	however	ADV
ajis02-68	51	2	,	,	PUNCT
ajis02-68	51	3	structural	structural	ADJ
ajis02-68	51	4	join	join	NOUN
ajis02-68	51	5	algorithms	algorithm	NOUN
ajis02-68	51	6	proposed	propose	VERB
ajis02-68	51	7	by	by	ADP
ajis02-68	51	8	al	al	PROPN
ajis02-68	51	9	-	-	PUNCT
ajis02-68	51	10	khalifa	khalifa	PROPN
ajis02-68	51	11	et	et	PROPN
ajis02-68	51	12	al	al	PROPN
ajis02-68	51	13	(	(	PUNCT
ajis02-68	51	14	2002	2002	NUM
ajis02-68	51	15	)	)	PUNCT
ajis02-68	51	16	exploit	exploit	VERB
ajis02-68	51	17	the	the	DET
ajis02-68	51	18	advantage	advantage	NOUN
ajis02-68	51	19	of	of	ADP
ajis02-68	51	20	element	element	NOUN
ajis02-68	51	21	numbering	numbering	NOUN
ajis02-68	51	22	to	to	PART
ajis02-68	51	23	decrease	decrease	VERB
ajis02-68	51	24	the	the	DET
ajis02-68	51	25	time	time	NOUN
ajis02-68	51	26	of	of	ADP
ajis02-68	51	27	processing	processing	NOUN
ajis02-68	51	28	(	(	PUNCT
ajis02-68	51	29	al	al	PROPN
ajis02-68	51	30	-	-	PUNCT
ajis02-68	51	31	khalifa	khalifa	PROPN
ajis02-68	51	32	et	et	NOUN
ajis02-68	51	33	al	al	PROPN
ajis02-68	51	34	2002	2002	NUM
ajis02-68	51	35	)	)	PUNCT
ajis02-68	51	36	.	.	PUNCT
ajis02-68	52	1	the	the	DET
ajis02-68	52	2	tree	tree	NOUN
ajis02-68	52	3	-	-	PUNCT
ajis02-68	52	4	merge	merge	NOUN
ajis02-68	52	5	join	join	NOUN
ajis02-68	52	6	algorithm	algorithm	NOUN
ajis02-68	52	7	is	be	AUX
ajis02-68	52	8	an	an	DET
ajis02-68	52	9	extension	extension	NOUN
ajis02-68	52	10	of	of	ADP
ajis02-68	52	11	relational	relational	ADJ
ajis02-68	52	12	equality	equality	NOUN
ajis02-68	52	13	merge	merge	VERB
ajis02-68	52	14	join	join	NOUN
ajis02-68	52	15	performed	perform	VERB
ajis02-68	52	16	on	on	ADP
ajis02-68	52	17	sorted	sorted	ADJ
ajis02-68	52	18	inputs	input	NOUN
ajis02-68	52	19	.	.	PUNCT
ajis02-68	53	1	the	the	DET
ajis02-68	53	2	time	time	NOUN
ajis02-68	53	3	complexity	complexity	NOUN
ajis02-68	53	4	of	of	ADP
ajis02-68	53	5	the	the	DET
ajis02-68	53	6	tree	tree	NOUN
ajis02-68	53	7	-	-	PUNCT
ajis02-68	53	8	merge	merge	NOUN
ajis02-68	53	9	join	join	NOUN
ajis02-68	53	10	is	be	AUX
ajis02-68	53	11	non	non	ADJ
ajis02-68	53	12	-	-	ADJ
ajis02-68	53	13	quadratic	quadratic	ADJ
ajis02-68	53	14	o(|e1|+|e2|	o(|e1|+|e2|	NOUN
ajis02-68	53	15	)	)	PUNCT
ajis02-68	53	16	,	,	PUNCT
ajis02-68	53	17	but	but	CCONJ
ajis02-68	53	18	may	may	AUX
ajis02-68	53	19	include	include	VERB
ajis02-68	53	20	multiple	multiple	ADJ
ajis02-68	53	21	passes	pass	NOUN
ajis02-68	53	22	over	over	ADP
ajis02-68	53	23	the	the	DET
ajis02-68	53	24	same	same	ADJ
ajis02-68	53	25	input	input	NOUN
ajis02-68	53	26	set	set	NOUN
ajis02-68	53	27	of	of	ADP
ajis02-68	53	28	descendant	descendant	ADJ
ajis02-68	53	29	nodes	node	NOUN
ajis02-68	53	30	.	.	PUNCT
ajis02-68	54	1	to	to	PART
ajis02-68	54	2	avoid	avoid	VERB
ajis02-68	54	3	this	this	DET
ajis02-68	54	4	problem	problem	NOUN
ajis02-68	54	5	,	,	PUNCT
ajis02-68	54	6	the	the	DET
ajis02-68	54	7	second	second	NOUN
ajis02-68	54	8	of	of	ADP
ajis02-68	54	9	the	the	DET
ajis02-68	54	10	proposed	propose	VERB
ajis02-68	54	11	algorithms	algorithm	NOUN
ajis02-68	54	12	,	,	PUNCT
ajis02-68	54	13	stack	stack	NOUN
ajis02-68	54	14	-	-	PUNCT
ajis02-68	54	15	tree	tree	NOUN
ajis02-68	54	16	join	join	NOUN
ajis02-68	54	17	algorithm	algorithm	NOUN
ajis02-68	54	18	,	,	PUNCT
ajis02-68	54	19	utilises	utilise	VERB
ajis02-68	54	20	stack	stack	NOUN
ajis02-68	54	21	of	of	ADP
ajis02-68	54	22	nodes	node	NOUN
ajis02-68	54	23	and	and	CCONJ
ajis02-68	54	24	has	have	VERB
ajis02-68	54	25	time	time	NOUN
ajis02-68	54	26	complexity	complexity	NOUN
ajis02-68	54	27	o((|e1|+|e2|)/b	o((|e1|+|e2|)/b	NOUN
ajis02-68	54	28	)	)	PUNCT
ajis02-68	54	29	,	,	PUNCT
ajis02-68	54	30	where	where	SCONJ
ajis02-68	54	31	b	b	NOUN
ajis02-68	54	32	is	be	AUX
ajis02-68	54	33	the	the	DET
ajis02-68	54	34	blocking	block	VERB
ajis02-68	54	35	factor	factor	NOUN
ajis02-68	54	36	.	.	PUNCT
ajis02-68	55	1	however	however	ADV
ajis02-68	55	2	,	,	PUNCT
ajis02-68	55	3	semi	semi	ADJ
ajis02-68	55	4	-	-	ADJ
ajis02-68	55	5	structured	structured	ADJ
ajis02-68	55	6	data	datum	NOUN
ajis02-68	55	7	imposes	impose	VERB
ajis02-68	55	8	new	new	ADJ
ajis02-68	55	9	challenges	challenge	NOUN
ajis02-68	55	10	for	for	ADP
ajis02-68	55	11	parallel	parallel	ADJ
ajis02-68	55	12	algorithms	algorithm	NOUN
ajis02-68	55	13	and	and	CCONJ
ajis02-68	55	14	requires	require	VERB
ajis02-68	55	15	new	new	ADJ
ajis02-68	55	16	methods	method	NOUN
ajis02-68	55	17	.	.	PUNCT
ajis02-68	56	1	data	datum	NOUN
ajis02-68	56	2	model	model	NOUN
ajis02-68	56	3	in	in	ADP
ajis02-68	56	4	representing	represent	VERB
ajis02-68	56	5	semi	semi	ADJ
ajis02-68	56	6	-	-	ADJ
ajis02-68	56	7	structured	structured	ADJ
ajis02-68	56	8	data	datum	NOUN
ajis02-68	56	9	,	,	PUNCT
ajis02-68	56	10	we	we	PRON
ajis02-68	56	11	use	use	VERB
ajis02-68	56	12	a	a	DET
ajis02-68	56	13	graph	graph	NOUN
ajis02-68	56	14	data	datum	NOUN
ajis02-68	56	15	model	model	NOUN
ajis02-68	56	16	labelled	label	VERB
ajis02-68	56	17	pseudo	pseudo	NOUN
ajis02-68	56	18	graph	graph	NOUN
ajis02-68	56	19	g	g	PROPN
ajis02-68	56	20	=	=	PUNCT
ajis02-68	56	21	{	{	PUNCT
ajis02-68	56	22	v	v	NOUN
ajis02-68	56	23	,	,	PUNCT
ajis02-68	56	24	a	a	PRON
ajis02-68	56	25	,	,	PUNCT
ajis02-68	56	26	l	l	NOUN
ajis02-68	56	27	}	}	PUNCT
ajis02-68	56	28	,	,	PUNCT
ajis02-68	56	29	where	where	SCONJ
ajis02-68	56	30	v	v	NOUN
ajis02-68	56	31	=	=	SYM
ajis02-68	56	32	{	{	PUNCT
ajis02-68	56	33	v1	v1	PROPN
ajis02-68	56	34	,	,	PUNCT
ajis02-68	56	35	…	…	PUNCT
ajis02-68	56	36	,	,	PUNCT
ajis02-68	56	37	vn	vn	PROPN
ajis02-68	56	38	}	}	PUNCT
ajis02-68	56	39	is	be	AUX
ajis02-68	56	40	a	a	DET
ajis02-68	56	41	non	non	ADJ
ajis02-68	56	42	-	-	ADJ
ajis02-68	56	43	empty	empty	ADJ
ajis02-68	56	44	finite	finite	NOUN
ajis02-68	56	45	set	set	NOUN
ajis02-68	56	46	of	of	ADP
ajis02-68	56	47	vertices	vertex	NOUN
ajis02-68	56	48	,	,	PUNCT
ajis02-68	56	49	a	a	DET
ajis02-68	56	50	=	=	X
ajis02-68	56	51	{	{	PUNCT
ajis02-68	56	52	(	(	PUNCT
ajis02-68	56	53	vi	vi	PROPN
ajis02-68	56	54	,	,	PUNCT
ajis02-68	56	55	vj)|vi	vj)|vi	NOUN
ajis02-68	56	56	,	,	PUNCT
ajis02-68	56	57	vj∈v	vj∈v	VERB
ajis02-68	56	58	}	}	PUNCT
ajis02-68	56	59	is	be	AUX
ajis02-68	56	60	a	a	DET
ajis02-68	56	61	finite	finite	ADJ
ajis02-68	56	62	set	set	NOUN
ajis02-68	56	63	of	of	ADP
ajis02-68	56	64	ordered	order	VERB
ajis02-68	56	65	pairs	pair	NOUN
ajis02-68	56	66	of	of	ADP
ajis02-68	56	67	vertices	vertex	NOUN
ajis02-68	56	68	called	call	VERB
ajis02-68	56	69	arcs	arc	NOUN
ajis02-68	56	70	,	,	PUNCT
ajis02-68	56	71	and	and	CCONJ
ajis02-68	56	72	l	l	NOUN
ajis02-68	56	73	=	=	SYM
ajis02-68	56	74	{	{	PUNCT
ajis02-68	56	75	l1	l1	PROPN
ajis02-68	56	76	,	,	PUNCT
ajis02-68	56	77	…	…	PUNCT
ajis02-68	56	78	,	,	PUNCT
ajis02-68	56	79	lk	lk	PROPN
ajis02-68	56	80	}	}	PUNCT
ajis02-68	56	81	is	be	AUX
ajis02-68	56	82	a	a	DET
ajis02-68	56	83	set	set	NOUN
ajis02-68	56	84	of	of	ADP
ajis02-68	56	85	labels	label	NOUN
ajis02-68	56	86	ascribed	ascribe	VERB
ajis02-68	56	87	to	to	ADP
ajis02-68	56	88	vertices	vertex	NOUN
ajis02-68	56	89	and/or	and/or	CCONJ
ajis02-68	56	90	arcs	arc	NOUN
ajis02-68	56	91	.	.	PUNCT
ajis02-68	57	1	such	such	ADJ
ajis02-68	57	2	definition	definition	NOUN
ajis02-68	57	3	of	of	ADP
ajis02-68	57	4	the	the	DET
ajis02-68	57	5	database	database	NOUN
ajis02-68	57	6	assumes	assume	VERB
ajis02-68	57	7	that	that	SCONJ
ajis02-68	57	8	a	a	DET
ajis02-68	57	9	graph	graph	NOUN
ajis02-68	57	10	can	can	AUX
ajis02-68	57	11	have	have	VERB
ajis02-68	57	12	loops	loop	NOUN
ajis02-68	57	13	and	and	CCONJ
ajis02-68	57	14	multiple	multiple	ADJ
ajis02-68	57	15	arcs	arc	NOUN
ajis02-68	57	16	among	among	ADP
ajis02-68	57	17	its	its	PRON
ajis02-68	57	18	vertices	vertex	NOUN
ajis02-68	57	19	.	.	PUNCT
ajis02-68	58	1	from	from	ADP
ajis02-68	58	2	the	the	DET
ajis02-68	58	3	perspective	perspective	NOUN
ajis02-68	58	4	of	of	ADP
ajis02-68	58	5	the	the	DET
ajis02-68	58	6	database	database	NOUN
ajis02-68	58	7	,	,	PUNCT
ajis02-68	58	8	a	a	DET
ajis02-68	58	9	vertex	vertex	NOUN
ajis02-68	58	10	of	of	ADP
ajis02-68	58	11	the	the	DET
ajis02-68	58	12	graph	graph	NOUN
ajis02-68	58	13	is	be	AUX
ajis02-68	58	14	an	an	DET
ajis02-68	58	15	object	object	NOUN
ajis02-68	58	16	of	of	ADP
ajis02-68	58	17	the	the	DET
ajis02-68	58	18	database	database	NOUN
ajis02-68	58	19	and	and	CCONJ
ajis02-68	58	20	an	an	DET
ajis02-68	58	21	arc	arc	NOUN
ajis02-68	58	22	is	be	AUX
ajis02-68	58	23	a	a	DET
ajis02-68	58	24	relation	relation	NOUN
ajis02-68	58	25	.	.	PUNCT
ajis02-68	59	1	the	the	DET
ajis02-68	59	2	data	data	NOUN
ajis02-68	59	3	graph	graph	NOUN
ajis02-68	59	4	has	have	VERB
ajis02-68	59	5	an	an	DET
ajis02-68	59	6	implicit	implicit	ADJ
ajis02-68	59	7	order	order	NOUN
ajis02-68	59	8	of	of	ADP
ajis02-68	59	9	its	its	PRON
ajis02-68	59	10	nodes	node	NOUN
ajis02-68	59	11	obtained	obtain	VERB
ajis02-68	59	12	by	by	ADP
ajis02-68	59	13	the	the	DET
ajis02-68	59	14	graph	graph	NOUN
ajis02-68	59	15	traversal	traversal	NOUN
ajis02-68	59	16	.	.	PUNCT
ajis02-68	60	1	in	in	ADP
ajis02-68	60	2	order	order	NOUN
ajis02-68	60	3	to	to	PART
ajis02-68	60	4	make	make	VERB
ajis02-68	60	5	most	most	ADJ
ajis02-68	60	6	of	of	ADP
ajis02-68	60	7	the	the	DET
ajis02-68	60	8	graph	graph	NOUN
ajis02-68	60	9	numbering	numbering	NOUN
ajis02-68	60	10	,	,	PUNCT
ajis02-68	60	11	we	we	PRON
ajis02-68	60	12	map	map	VERB
ajis02-68	60	13	original	original	ADJ
ajis02-68	60	14	data	datum	NOUN
ajis02-68	60	15	graph	graph	NOUN
ajis02-68	60	16	into	into	ADP
ajis02-68	60	17	a	a	DET
ajis02-68	60	18	directed	direct	VERB
ajis02-68	60	19	cyclic	cyclic	ADJ
ajis02-68	60	20	graph	graph	NOUN
ajis02-68	60	21	.	.	PUNCT
ajis02-68	61	1	one	one	NUM
ajis02-68	61	2	of	of	ADP
ajis02-68	61	3	the	the	DET
ajis02-68	61	4	important	important	ADJ
ajis02-68	61	5	properties	property	NOUN
ajis02-68	61	6	of	of	ADP
ajis02-68	61	7	the	the	DET
ajis02-68	61	8	directed	direct	VERB
ajis02-68	61	9	cyclic	cyclic	ADJ
ajis02-68	61	10	graph	graph	NOUN
ajis02-68	61	11	is	be	AUX
ajis02-68	61	12	that	that	SCONJ
ajis02-68	61	13	it	it	PRON
ajis02-68	61	14	has	have	VERB
ajis02-68	61	15	a	a	DET
ajis02-68	61	16	cyclic	cyclic	ADJ
ajis02-68	61	17	ordering	ordering	NOUN
ajis02-68	61	18	of	of	ADP
ajis02-68	61	19	nodes	node	NOUN
ajis02-68	61	20	.	.	PUNCT
ajis02-68	62	1	we	we	PRON
ajis02-68	62	2	exploit	exploit	VERB
ajis02-68	62	3	this	this	DET
ajis02-68	62	4	property	property	NOUN
ajis02-68	62	5	to	to	PART
ajis02-68	62	6	define	define	VERB
ajis02-68	62	7	a	a	DET
ajis02-68	62	8	position	position	NOUN
ajis02-68	62	9	of	of	ADP
ajis02-68	62	10	every	every	DET
ajis02-68	62	11	node	node	NOUN
ajis02-68	62	12	in	in	ADP
ajis02-68	62	13	the	the	DET
ajis02-68	62	14	graph	graph	NOUN
ajis02-68	62	15	.	.	PUNCT
ajis02-68	63	1	each	each	DET
ajis02-68	63	2	object	object	NOUN
ajis02-68	63	3	and	and	CCONJ
ajis02-68	63	4	relation	relation	NOUN
ajis02-68	63	5	within	within	ADP
ajis02-68	63	6	the	the	DET
ajis02-68	63	7	database	database	NOUN
ajis02-68	63	8	forms	form	VERB
ajis02-68	63	9	a	a	DET
ajis02-68	63	10	node	node	NOUN
ajis02-68	63	11	of	of	ADP
ajis02-68	63	12	the	the	DET
ajis02-68	63	13	numbering	numbering	NOUN
ajis02-68	63	14	graph	graph	NOUN
ajis02-68	63	15	.	.	PUNCT
ajis02-68	64	1	the	the	DET
ajis02-68	64	2	edges	edge	NOUN
ajis02-68	64	3	of	of	ADP
ajis02-68	64	4	the	the	DET
ajis02-68	64	5	graph	graph	NOUN
ajis02-68	64	6	stand	stand	VERB
ajis02-68	64	7	for	for	ADP
ajis02-68	64	8	relationships	relationship	NOUN
ajis02-68	64	9	between	between	ADP
ajis02-68	64	10	both	both	PRON
ajis02-68	64	11	of	of	ADP
ajis02-68	64	12	these	these	DET
ajis02-68	64	13	elements	element	NOUN
ajis02-68	64	14	,	,	PUNCT
ajis02-68	64	15	objects	object	NOUN
ajis02-68	64	16	and	and	CCONJ
ajis02-68	64	17	relations	relation	NOUN
ajis02-68	64	18	.	.	PUNCT
ajis02-68	65	1	relations	relation	NOUN
ajis02-68	65	2	that	that	PRON
ajis02-68	65	3	form	form	NOUN
ajis02-68	65	4	cycles	cycle	NOUN
ajis02-68	65	5	are	be	AUX
ajis02-68	65	6	reversed	reverse	VERB
ajis02-68	65	7	and	and	CCONJ
ajis02-68	65	8	relabelled	relabelle	VERB
ajis02-68	65	9	.	.	PUNCT
ajis02-68	66	1	position	position	NOUN
ajis02-68	66	2	is	be	AUX
ajis02-68	66	3	an	an	DET
ajis02-68	66	4	important	important	ADJ
ajis02-68	66	5	characteristic	characteristic	NOUN
ajis02-68	66	6	of	of	ADP
ajis02-68	66	7	graph	graph	NOUN
ajis02-68	66	8	nodes	node	NOUN
ajis02-68	66	9	and	and	CCONJ
ajis02-68	66	10	intensely	intensely	ADV
ajis02-68	66	11	used	use	VERB
ajis02-68	66	12	for	for	ADP
ajis02-68	66	13	indexing	indexing	NOUN
ajis02-68	66	14	and	and	CCONJ
ajis02-68	66	15	querying	query	VERB
ajis02-68	66	16	semistructured	semistructure	VERB
ajis02-68	66	17	data	datum	NOUN
ajis02-68	66	18	.	.	PUNCT
ajis02-68	67	1	the	the	DET
ajis02-68	67	2	position	position	NOUN
ajis02-68	67	3	of	of	ADP
ajis02-68	67	4	the	the	DET
ajis02-68	67	5	node	node	PROPN
ajis02-68	67	6	ni	ni	PROPN
ajis02-68	67	7	is	be	AUX
ajis02-68	67	8	denoted	denote	VERB
ajis02-68	67	9	as	as	ADP
ajis02-68	67	10	(	(	PUNCT
ajis02-68	67	11	di	di	NOUN
ajis02-68	67	12	,	,	PUNCT
ajis02-68	67	13	si	si	X
ajis02-68	67	14	,	,	PUNCT
ajis02-68	67	15	ei	ei	PROPN
ajis02-68	67	16	,	,	PUNCT
ajis02-68	67	17	li	li	PROPN
ajis02-68	67	18	)	)	PUNCT
ajis02-68	67	19	,	,	PUNCT
ajis02-68	67	20	where	where	SCONJ
ajis02-68	67	21	di	di	NOUN
ajis02-68	67	22	is	be	AUX
ajis02-68	67	23	the	the	DET
ajis02-68	67	24	graph	graph	NOUN
ajis02-68	67	25	component	component	NOUN
ajis02-68	67	26	identifier	identifier	NOUN
ajis02-68	67	27	within	within	ADP
ajis02-68	67	28	the	the	DET
ajis02-68	67	29	database	database	NOUN
ajis02-68	67	30	;	;	PUNCT
ajis02-68	67	31	si	si	X
ajis02-68	67	32	,	,	PUNCT
ajis02-68	67	33	ei	ei	X
ajis02-68	67	34	are	be	AUX
ajis02-68	67	35	distinct	distinct	ADJ
ajis02-68	67	36	graph	graph	NOUN
ajis02-68	67	37	ordering	order	VERB
ajis02-68	67	38	numbers	number	NOUN
ajis02-68	67	39	of	of	ADP
ajis02-68	67	40	the	the	DET
ajis02-68	67	41	node	node	PROPN
ajis02-68	67	42	ni	ni	PROPN
ajis02-68	67	43	(	(	PUNCT
ajis02-68	67	44	pre	pre	ADJ
ajis02-68	67	45	-	-	NOUN
ajis02-68	67	46	order	order	NOUN
ajis02-68	67	47	and	and	CCONJ
ajis02-68	67	48	post	post	ADJ
ajis02-68	67	49	-	-	NOUN
ajis02-68	67	50	order	order	NOUN
ajis02-68	67	51	respectively	respectively	ADV
ajis02-68	67	52	)	)	PUNCT
ajis02-68	67	53	,	,	PUNCT
ajis02-68	67	54	and	and	CCONJ
ajis02-68	67	55	li	li	PROPN
ajis02-68	67	56	is	be	AUX
ajis02-68	67	57	the	the	DET
ajis02-68	67	58	nesting	nesting	ADJ
ajis02-68	67	59	depth	depth	NOUN
ajis02-68	67	60	of	of	ADP
ajis02-68	67	61	the	the	DET
ajis02-68	67	62	node	node	PROPN
ajis02-68	67	63	ni	ni	PROPN
ajis02-68	67	64	within	within	ADP
ajis02-68	67	65	the	the	DET
ajis02-68	67	66	graph	graph	NOUN
ajis02-68	67	67	.	.	PUNCT
ajis02-68	68	1	the	the	DET
ajis02-68	68	2	ancestor	ancestor	NOUN
ajis02-68	68	3	-	-	PUNCT
ajis02-68	68	4	descendant	descendant	NOUN
ajis02-68	68	5	relationship	relationship	NOUN
ajis02-68	68	6	gives	give	VERB
ajis02-68	68	7	a	a	DET
ajis02-68	68	8	graph	graph	NOUN
ajis02-68	68	9	node	node	NOUN
ajis02-68	68	10	of	of	ADP
ajis02-68	68	11	ni	ni	PROPN
ajis02-68	68	12	,	,	PUNCT
ajis02-68	68	13	and	and	CCONJ
ajis02-68	68	14	position	position	NOUN
ajis02-68	68	15	(	(	PUNCT
ajis02-68	68	16	di	di	NOUN
ajis02-68	68	17	,	,	PUNCT
ajis02-68	68	18	si	si	X
ajis02-68	68	19	,	,	PUNCT
ajis02-68	68	20	ei	ei	PROPN
ajis02-68	68	21	,	,	PUNCT
ajis02-68	68	22	li	li	PROPN
ajis02-68	68	23	)	)	PUNCT
ajis02-68	68	24	.	.	PUNCT
ajis02-68	69	1	the	the	DET
ajis02-68	69	2	graph	graph	NOUN
ajis02-68	69	3	node	node	PROPN
ajis02-68	69	4	nj	nj	PROPN
ajis02-68	69	5	and	and	CCONJ
ajis02-68	69	6	its	its	PRON
ajis02-68	69	7	position	position	NOUN
ajis02-68	69	8	(	(	PUNCT
ajis02-68	69	9	dj	dj	NOUN
ajis02-68	69	10	,	,	PUNCT
ajis02-68	69	11	sj	sj	INTJ
ajis02-68	69	12	,	,	PUNCT
ajis02-68	69	13	ej	ej	PROPN
ajis02-68	69	14	,	,	PUNCT
ajis02-68	69	15	lj	lj	PROPN
ajis02-68	69	16	)	)	PUNCT
ajis02-68	69	17	,	,	PUNCT
ajis02-68	69	18	the	the	DET
ajis02-68	69	19	node	node	PROPN
ajis02-68	69	20	ni	ni	PROPN
ajis02-68	69	21	is	be	AUX
ajis02-68	69	22	an	an	DET
ajis02-68	69	23	ancestor	ancestor	NOUN
ajis02-68	69	24	of	of	ADP
ajis02-68	69	25	the	the	DET
ajis02-68	69	26	node	node	PROPN
ajis02-68	69	27	nj	nj	PROPN
ajis02-68	69	28	(	(	PUNCT
ajis02-68	69	29	and	and	CCONJ
ajis02-68	69	30	node	node	PROPN
ajis02-68	69	31	nj	nj	PROPN
ajis02-68	69	32	is	be	AUX
ajis02-68	69	33	a	a	DET
ajis02-68	69	34	descendant	descendant	NOUN
ajis02-68	69	35	of	of	ADP
ajis02-68	69	36	the	the	DET
ajis02-68	69	37	node	node	PROPN
ajis02-68	69	38	ni	ni	PROPN
ajis02-68	69	39	)	)	PUNCT
ajis02-68	69	40	if	if	SCONJ
ajis02-68	69	41	di	di	NOUN
ajis02-68	69	42	=	=	NOUN
ajis02-68	69	43	dj	dj	X
ajis02-68	69	44	(	(	PUNCT
ajis02-68	69	45	both	both	DET
ajis02-68	69	46	nodes	node	NOUN
ajis02-68	69	47	belong	belong	VERB
ajis02-68	69	48	to	to	ADP
ajis02-68	69	49	the	the	DET
ajis02-68	69	50	same	same	ADJ
ajis02-68	69	51	component	component	NOUN
ajis02-68	69	52	)	)	PUNCT
ajis02-68	69	53	,	,	PUNCT
ajis02-68	69	54	si	si	X
ajis02-68	69	55	<	<	X
ajis02-68	69	56	sj	sj	INTJ
ajis02-68	69	57	and	and	CCONJ
ajis02-68	69	58	ei	ei	X
ajis02-68	69	59	>	>	X
ajis02-68	69	60	ej	ej	PROPN
ajis02-68	69	61	(	(	PUNCT
ajis02-68	69	62	ancestor	ancestor	NOUN
ajis02-68	69	63	-	-	PUNCT
ajis02-68	69	64	descendant	descendant	NOUN
ajis02-68	69	65	)	)	PUNCT
ajis02-68	69	66	or	or	CCONJ
ajis02-68	69	67	si	si	INTJ
ajis02-68	69	68	>	>	X
ajis02-68	69	69	sj	sj	INTJ
ajis02-68	69	70	and	and	CCONJ
ajis02-68	69	71	ei	ei	X
ajis02-68	69	72	<	<	X
ajis02-68	69	73	ej	ej	PROPN
ajis02-68	69	74	(	(	PUNCT
ajis02-68	69	75	descendant	descendant	ADJ
ajis02-68	69	76	-	-	NOUN
ajis02-68	69	77	ancestor	ancestor	NOUN
ajis02-68	69	78	)	)	PUNCT
ajis02-68	69	79	.	.	PUNCT
ajis02-68	70	1	intermediate	intermediate	ADJ
ajis02-68	70	2	nodes	node	NOUN
ajis02-68	70	3	nx	nx	X
ajis02-68	70	4	and	and	CCONJ
ajis02-68	70	5	their	their	PRON
ajis02-68	70	6	positions	position	NOUN
ajis02-68	70	7	(	(	PUNCT
ajis02-68	70	8	dx	dx	PROPN
ajis02-68	70	9	,	,	PUNCT
ajis02-68	70	10	sx	sx	PROPN
ajis02-68	70	11	,	,	PUNCT
ajis02-68	70	12	ex	ex	NOUN
ajis02-68	70	13	,	,	PUNCT
ajis02-68	70	14	lx	lx	NOUN
ajis02-68	70	15	)	)	PUNCT
ajis02-68	70	16	that	that	PRON
ajis02-68	70	17	constitute	constitute	VERB
ajis02-68	70	18	path	path	NOUN
ajis02-68	70	19	between	between	ADP
ajis02-68	70	20	the	the	DET
ajis02-68	70	21	two	two	NUM
ajis02-68	70	22	nodes	node	NOUN
ajis02-68	70	23	are	be	AUX
ajis02-68	70	24	select	select	ADJ
ajis02-68	70	25	to	to	PART
ajis02-68	70	26	meet	meet	VERB
ajis02-68	70	27	the	the	DET
ajis02-68	70	28	criteria	criterion	NOUN
ajis02-68	70	29	:	:	PUNCT
ajis02-68	70	30	ajis	ajis	ADV
ajis02-68	70	31	vol	vol	NOUN
ajis02-68	70	32	13	13	NUM
ajis02-68	70	33	,	,	PUNCT
ajis02-68	70	34	no	no	INTJ
ajis02-68	70	35	.	.	NOUN
ajis02-68	70	36	1	1	NUM
ajis02-68	70	37	september	september	PROPN
ajis02-68	70	38	2005	2005	NUM
ajis02-68	70	39	153	153	NUM
ajis02-68	70	40	dx	dx	PROPN
ajis02-68	70	41	=	=	SYM
ajis02-68	70	42	di	di	X
ajis02-68	70	43	=	=	SYM
ajis02-68	70	44	dj	dj	PROPN
ajis02-68	70	45	,	,	PUNCT
ajis02-68	70	46	si	si	X
ajis02-68	70	47	<	<	X
ajis02-68	70	48	sx	sx	X
ajis02-68	70	49	<	<	X
ajis02-68	70	50	sj	sj	NOUN
ajis02-68	70	51	and	and	CCONJ
ajis02-68	70	52	ei	ei	X
ajis02-68	70	53	>	>	X
ajis02-68	70	54	ex	ex	X
ajis02-68	70	55	>	>	X
ajis02-68	70	56	ej	ej	PROPN
ajis02-68	70	57	(	(	PUNCT
ajis02-68	70	58	node	node	PROPN
ajis02-68	70	59	ni	ni	PROPN
ajis02-68	70	60	is	be	AUX
ajis02-68	70	61	an	an	DET
ajis02-68	70	62	ancestor	ancestor	NOUN
ajis02-68	70	63	of	of	ADP
ajis02-68	70	64	the	the	DET
ajis02-68	70	65	node	node	PROPN
ajis02-68	70	66	nj	nj	PROPN
ajis02-68	70	67	)	)	PUNCT
ajis02-68	70	68	;	;	PUNCT
ajis02-68	70	69	or	or	CCONJ
ajis02-68	70	70	dx	dx	PROPN
ajis02-68	70	71	=	=	SYM
ajis02-68	70	72	di	di	X
ajis02-68	70	73	=	=	SYM
ajis02-68	70	74	dj	dj	PROPN
ajis02-68	70	75	,	,	PUNCT
ajis02-68	70	76	si	si	PROPN
ajis02-68	70	77	>	>	X
ajis02-68	70	78	sx	sx	PROPN
ajis02-68	70	79	>	>	X
ajis02-68	70	80	sj	sj	PROPN
ajis02-68	70	81	and	and	CCONJ
ajis02-68	70	82	ei	ei	X
ajis02-68	70	83	<	<	X
ajis02-68	70	84	ex	ex	X
ajis02-68	70	85	<	<	X
ajis02-68	70	86	ej	ej	X
ajis02-68	70	87	(	(	PUNCT
ajis02-68	70	88	node	node	PROPN
ajis02-68	70	89	ni	ni	PROPN
ajis02-68	70	90	is	be	AUX
ajis02-68	70	91	a	a	DET
ajis02-68	70	92	descendant	descendant	NOUN
ajis02-68	70	93	of	of	ADP
ajis02-68	70	94	the	the	DET
ajis02-68	70	95	node	node	PROPN
ajis02-68	70	96	nj	nj	PROPN
ajis02-68	70	97	)	)	PUNCT
ajis02-68	70	98	.	.	PUNCT
ajis02-68	71	1	the	the	DET
ajis02-68	71	2	sibling	sible	VERB
ajis02-68	71	3	relationship	relationship	NOUN
ajis02-68	71	4	gives	give	VERB
ajis02-68	71	5	graph	graph	VERB
ajis02-68	71	6	node	node	PROPN
ajis02-68	71	7	ni	ni	PROPN
ajis02-68	71	8	and	and	CCONJ
ajis02-68	71	9	its	its	PRON
ajis02-68	71	10	position	position	NOUN
ajis02-68	71	11	(	(	PUNCT
ajis02-68	71	12	di	di	NOUN
ajis02-68	71	13	,	,	PUNCT
ajis02-68	71	14	si	si	X
ajis02-68	71	15	,	,	PUNCT
ajis02-68	71	16	ei	ei	PROPN
ajis02-68	71	17	,	,	PUNCT
ajis02-68	71	18	li	li	PROPN
ajis02-68	71	19	)	)	PUNCT
ajis02-68	71	20	.	.	PUNCT
ajis02-68	72	1	the	the	DET
ajis02-68	72	2	graph	graph	NOUN
ajis02-68	72	3	node	node	PROPN
ajis02-68	72	4	nj	nj	PROPN
ajis02-68	72	5	and	and	CCONJ
ajis02-68	72	6	its	its	PRON
ajis02-68	72	7	position	position	NOUN
ajis02-68	72	8	(	(	PUNCT
ajis02-68	72	9	dj	dj	NOUN
ajis02-68	72	10	,	,	PUNCT
ajis02-68	72	11	sj	sj	INTJ
ajis02-68	72	12	,	,	PUNCT
ajis02-68	72	13	ej	ej	PROPN
ajis02-68	72	14	,	,	PUNCT
ajis02-68	72	15	lj	lj	PROPN
ajis02-68	72	16	)	)	PUNCT
ajis02-68	72	17	,	,	PUNCT
ajis02-68	72	18	the	the	DET
ajis02-68	72	19	node	node	PROPN
ajis02-68	72	20	ni	ni	PROPN
ajis02-68	72	21	is	be	AUX
ajis02-68	72	22	a	a	DET
ajis02-68	72	23	sibling	sibling	NOUN
ajis02-68	72	24	of	of	ADP
ajis02-68	72	25	the	the	DET
ajis02-68	72	26	node	node	PROPN
ajis02-68	72	27	nj	nj	PROPN
ajis02-68	72	28	(	(	PUNCT
ajis02-68	72	29	and	and	CCONJ
ajis02-68	72	30	node	node	PROPN
ajis02-68	72	31	nj	nj	PROPN
ajis02-68	72	32	is	be	AUX
ajis02-68	72	33	a	a	DET
ajis02-68	72	34	sibling	sibling	NOUN
ajis02-68	72	35	of	of	ADP
ajis02-68	72	36	the	the	DET
ajis02-68	72	37	node	node	PROPN
ajis02-68	72	38	ni	ni	PROPN
ajis02-68	72	39	)	)	PUNCT
ajis02-68	72	40	if	if	SCONJ
ajis02-68	72	41	di	di	NOUN
ajis02-68	72	42	=	=	NOUN
ajis02-68	72	43	dj	dj	X
ajis02-68	72	44	(	(	PUNCT
ajis02-68	72	45	both	both	DET
ajis02-68	72	46	nodes	node	NOUN
ajis02-68	72	47	belong	belong	VERB
ajis02-68	72	48	to	to	ADP
ajis02-68	72	49	the	the	DET
ajis02-68	72	50	same	same	ADJ
ajis02-68	72	51	component	component	NOUN
ajis02-68	72	52	)	)	PUNCT
ajis02-68	72	53	,	,	PUNCT
ajis02-68	72	54	si	si	X
ajis02-68	72	55	<	<	X
ajis02-68	72	56	sj	sj	INTJ
ajis02-68	72	57	and	and	CCONJ
ajis02-68	72	58	ei	ei	X
ajis02-68	72	59	<	<	X
ajis02-68	72	60	ej	ej	X
ajis02-68	72	61	(	(	PUNCT
ajis02-68	72	62	preceding	precede	VERB
ajis02-68	72	63	)	)	PUNCT
ajis02-68	72	64	or	or	CCONJ
ajis02-68	72	65	si	si	INTJ
ajis02-68	72	66	>	>	X
ajis02-68	72	67	sj	sj	INTJ
ajis02-68	72	68	and	and	CCONJ
ajis02-68	72	69	ei	ei	X
ajis02-68	72	70	>	>	X
ajis02-68	72	71	ej	ej	PROPN
ajis02-68	72	72	(	(	PUNCT
ajis02-68	72	73	following	follow	VERB
ajis02-68	72	74	)	)	PUNCT
ajis02-68	72	75	.	.	PUNCT
ajis02-68	73	1	the	the	DET
ajis02-68	73	2	path	path	NOUN
ajis02-68	73	3	between	between	ADP
ajis02-68	73	4	these	these	DET
ajis02-68	73	5	two	two	NUM
ajis02-68	73	6	nodes	node	NOUN
ajis02-68	73	7	is	be	AUX
ajis02-68	73	8	selected	select	VERB
ajis02-68	73	9	with	with	ADP
ajis02-68	73	10	respect	respect	NOUN
ajis02-68	73	11	to	to	ADP
ajis02-68	73	12	one	one	NUM
ajis02-68	73	13	of	of	ADP
ajis02-68	73	14	the	the	DET
ajis02-68	73	15	common	common	ADJ
ajis02-68	73	16	ancestors	ancestor	NOUN
ajis02-68	73	17	of	of	ADP
ajis02-68	73	18	nodes	node	NOUN
ajis02-68	73	19	ni	ni	PROPN
ajis02-68	73	20	and	and	CCONJ
ajis02-68	73	21	nj	nj	PROPN
ajis02-68	73	22	,	,	PUNCT
ajis02-68	73	23	nc	nc	PROPN
ajis02-68	73	24	and	and	CCONJ
ajis02-68	73	25	its	its	PRON
ajis02-68	73	26	position	position	NOUN
ajis02-68	73	27	(	(	PUNCT
ajis02-68	73	28	dc	dc	PROPN
ajis02-68	73	29	,	,	PUNCT
ajis02-68	73	30	sc	sc	PROPN
ajis02-68	73	31	,	,	PUNCT
ajis02-68	73	32	ec	ec	PROPN
ajis02-68	73	33	,	,	PUNCT
ajis02-68	73	34	lc	lc	PROPN
ajis02-68	73	35	):	):	PUNCT
ajis02-68	73	36	dc	dc	PROPN
ajis02-68	73	37	=	=	SYM
ajis02-68	73	38	di	di	PROPN
ajis02-68	73	39	=	=	SYM
ajis02-68	73	40	dj	dj	PROPN
ajis02-68	73	41	,	,	PUNCT
ajis02-68	73	42	sc	sc	X
ajis02-68	73	43	<	<	X
ajis02-68	73	44	min(si	min(si	PROPN
ajis02-68	73	45	,	,	PUNCT
ajis02-68	73	46	sj	sj	NOUN
ajis02-68	73	47	)	)	PUNCT
ajis02-68	73	48	and	and	CCONJ
ajis02-68	73	49	ec	ec	PROPN
ajis02-68	73	50	>	>	X
ajis02-68	73	51	max(ei	max(ei	PROPN
ajis02-68	73	52	,	,	PUNCT
ajis02-68	73	53	ej	ej	PROPN
ajis02-68	73	54	)	)	PUNCT
ajis02-68	73	55	.	.	PUNCT
ajis02-68	74	1	then	then	ADV
ajis02-68	74	2	intermediate	intermediate	ADJ
ajis02-68	74	3	nodes	node	NOUN
ajis02-68	74	4	nx	nx	X
ajis02-68	74	5	and	and	CCONJ
ajis02-68	74	6	their	their	PRON
ajis02-68	74	7	positions	position	NOUN
ajis02-68	74	8	(	(	PUNCT
ajis02-68	74	9	dx	dx	PROPN
ajis02-68	74	10	,	,	PUNCT
ajis02-68	74	11	sx	sx	PROPN
ajis02-68	74	12	,	,	PUNCT
ajis02-68	74	13	ex	ex	NOUN
ajis02-68	74	14	,	,	PUNCT
ajis02-68	74	15	lx	lx	NOUN
ajis02-68	74	16	)	)	PUNCT
ajis02-68	74	17	are	be	AUX
ajis02-68	74	18	select	select	ADJ
ajis02-68	74	19	to	to	PART
ajis02-68	74	20	meet	meet	VERB
ajis02-68	74	21	the	the	DET
ajis02-68	74	22	criteria	criterion	NOUN
ajis02-68	74	23	:	:	PUNCT
ajis02-68	74	24	dx	dx	PROPN
ajis02-68	74	25	=	=	SYM
ajis02-68	74	26	dc	dc	PROPN
ajis02-68	74	27	,	,	PUNCT
ajis02-68	74	28	si	si	X
ajis02-68	74	29	<	<	X
ajis02-68	74	30	sx	sx	PROPN
ajis02-68	74	31	<	<	X
ajis02-68	74	32	sc	sc	PROPN
ajis02-68	74	33	and	and	CCONJ
ajis02-68	74	34	ei	ei	X
ajis02-68	74	35	>	>	X
ajis02-68	74	36	ex	ex	X
ajis02-68	74	37	>	>	X
ajis02-68	74	38	ec	ec	PROPN
ajis02-68	74	39	or	or	CCONJ
ajis02-68	74	40	sc	sc	PROPN
ajis02-68	74	41	<	<	X
ajis02-68	74	42	sx	sx	X
ajis02-68	74	43	<	<	X
ajis02-68	74	44	sj	sj	PROPN
ajis02-68	74	45	and	and	CCONJ
ajis02-68	74	46	ec	ec	PROPN
ajis02-68	74	47	>	>	PUNCT
ajis02-68	74	48	ex	ex	X
ajis02-68	74	49	>	>	X
ajis02-68	74	50	ej	ej	PROPN
ajis02-68	74	51	(	(	PUNCT
ajis02-68	74	52	ni	ni	PROPN
ajis02-68	74	53	precedes	precede	VERB
ajis02-68	74	54	nj	nj	PROPN
ajis02-68	74	55	)	)	PUNCT
ajis02-68	74	56	;	;	PUNCT
ajis02-68	74	57	or	or	CCONJ
ajis02-68	74	58	dx	dx	PROPN
ajis02-68	74	59	=	=	SYM
ajis02-68	74	60	dc	dc	PROPN
ajis02-68	74	61	,	,	PUNCT
ajis02-68	74	62	sj	sj	PROPN
ajis02-68	74	63	<	<	X
ajis02-68	74	64	sx	sx	PROPN
ajis02-68	74	65	<	<	X
ajis02-68	74	66	sc	sc	PROPN
ajis02-68	74	67	and	and	CCONJ
ajis02-68	74	68	ej	ej	ADJ
ajis02-68	74	69	>	>	X
ajis02-68	74	70	ex	ex	X
ajis02-68	74	71	>	>	X
ajis02-68	74	72	ec	ec	PROPN
ajis02-68	74	73	or	or	CCONJ
ajis02-68	74	74	sc	sc	PROPN
ajis02-68	74	75	<	<	X
ajis02-68	74	76	sx	sx	X
ajis02-68	74	77	<	<	X
ajis02-68	74	78	si	si	PROPN
ajis02-68	74	79	and	and	CCONJ
ajis02-68	74	80	ec	ec	PROPN
ajis02-68	74	81	>	>	PUNCT
ajis02-68	74	82	ex	ex	X
ajis02-68	74	83	>	>	X
ajis02-68	74	84	ei	ei	X
ajis02-68	74	85	(	(	PUNCT
ajis02-68	74	86	ni	ni	PROPN
ajis02-68	74	87	follows	follow	VERB
ajis02-68	74	88	nj	nj	PROPN
ajis02-68	74	89	)	)	PUNCT
ajis02-68	74	90	.	.	PUNCT
ajis02-68	75	1	finding	find	VERB
ajis02-68	75	2	a	a	DET
ajis02-68	75	3	relationship	relationship	NOUN
ajis02-68	75	4	between	between	ADP
ajis02-68	75	5	a	a	DET
ajis02-68	75	6	pair	pair	NOUN
ajis02-68	75	7	of	of	ADP
ajis02-68	75	8	nodes	node	NOUN
ajis02-68	75	9	is	be	AUX
ajis02-68	75	10	the	the	DET
ajis02-68	75	11	core	core	NOUN
ajis02-68	75	12	operation	operation	NOUN
ajis02-68	75	13	of	of	ADP
ajis02-68	75	14	the	the	DET
ajis02-68	75	15	semi	semi	ADJ
ajis02-68	75	16	-	-	ADJ
ajis02-68	75	17	structured	structured	ADJ
ajis02-68	75	18	data	datum	NOUN
ajis02-68	75	19	query	query	NOUN
ajis02-68	75	20	processing	processing	NOUN
ajis02-68	75	21	.	.	PUNCT
ajis02-68	76	1	graph	graph	NOUN
ajis02-68	76	2	numbering	numbering	NOUN
ajis02-68	76	3	is	be	AUX
ajis02-68	76	4	the	the	DET
ajis02-68	76	5	efficient	efficient	ADJ
ajis02-68	76	6	way	way	NOUN
ajis02-68	76	7	to	to	PART
ajis02-68	76	8	determine	determine	VERB
ajis02-68	76	9	it	it	PRON
ajis02-68	76	10	fast	fast	ADV
ajis02-68	76	11	.	.	PUNCT
ajis02-68	77	1	nevertheless	nevertheless	ADV
ajis02-68	77	2	,	,	PUNCT
ajis02-68	77	3	the	the	DET
ajis02-68	77	4	scale	scale	NOUN
ajis02-68	77	5	of	of	ADP
ajis02-68	77	6	the	the	DET
ajis02-68	77	7	real	real	ADJ
ajis02-68	77	8	-	-	PUNCT
ajis02-68	77	9	world	world	NOUN
ajis02-68	77	10	data	datum	NOUN
ajis02-68	77	11	challenges	challenge	VERB
ajis02-68	77	12	its	its	PRON
ajis02-68	77	13	wide	wide	ADJ
ajis02-68	77	14	application	application	NOUN
ajis02-68	77	15	.	.	PUNCT
ajis02-68	78	1	as	as	ADP
ajis02-68	78	2	one	one	NUM
ajis02-68	78	3	of	of	ADP
ajis02-68	78	4	the	the	DET
ajis02-68	78	5	solutions	solution	NOUN
ajis02-68	78	6	to	to	PART
ajis02-68	78	7	overcome	overcome	VERB
ajis02-68	78	8	scale	scale	NOUN
ajis02-68	78	9	problem	problem	NOUN
ajis02-68	78	10	,	,	PUNCT
ajis02-68	78	11	we	we	PRON
ajis02-68	78	12	use	use	VERB
ajis02-68	78	13	graph	graph	NOUN
ajis02-68	78	14	layering	layer	VERB
ajis02-68	78	15	as	as	SCONJ
ajis02-68	78	16	shown	show	VERB
ajis02-68	78	17	in	in	ADP
ajis02-68	78	18	figure	figure	NOUN
ajis02-68	78	19	1	1	NUM
ajis02-68	78	20	.	.	PUNCT
ajis02-68	78	21	figure	figure	NOUN
ajis02-68	78	22	1	1	NUM
ajis02-68	78	23	.	.	PUNCT
ajis02-68	79	1	layered	layered	ADJ
ajis02-68	79	2	data	datum	NOUN
ajis02-68	79	3	view	view	VERB
ajis02-68	79	4	the	the	DET
ajis02-68	79	5	original	original	ADJ
ajis02-68	79	6	data	data	NOUN
ajis02-68	79	7	graph	graph	NOUN
ajis02-68	79	8	is	be	AUX
ajis02-68	79	9	processed	process	VERB
ajis02-68	79	10	in	in	ADP
ajis02-68	79	11	order	order	NOUN
ajis02-68	79	12	to	to	PART
ajis02-68	79	13	determine	determine	VERB
ajis02-68	79	14	its	its	PRON
ajis02-68	79	15	strong	strong	ADJ
ajis02-68	79	16	components	component	NOUN
ajis02-68	79	17	.	.	PUNCT
ajis02-68	80	1	a	a	DET
ajis02-68	80	2	strong	strong	ADJ
ajis02-68	80	3	component	component	NOUN
ajis02-68	80	4	d	d	NOUN
ajis02-68	80	5	of	of	ADP
ajis02-68	80	6	a	a	DET
ajis02-68	80	7	graph	graph	NOUN
ajis02-68	80	8	g	g	NOUN
ajis02-68	80	9	is	be	AUX
ajis02-68	80	10	a	a	DET
ajis02-68	80	11	sub	sub	NOUN
ajis02-68	80	12	graph	graph	NOUN
ajis02-68	80	13	of	of	ADP
ajis02-68	80	14	every	every	DET
ajis02-68	80	15	node	node	NOUN
ajis02-68	80	16	in	in	ADP
ajis02-68	80	17	d	d	PROPN
ajis02-68	80	18	and	and	CCONJ
ajis02-68	80	19	the	the	DET
ajis02-68	80	20	removal	removal	NOUN
ajis02-68	80	21	of	of	ADP
ajis02-68	80	22	that	that	DET
ajis02-68	80	23	node	node	NOUN
ajis02-68	80	24	does	do	AUX
ajis02-68	80	25	not	not	PART
ajis02-68	80	26	make	make	VERB
ajis02-68	80	27	d	d	AUX
ajis02-68	80	28	none	none	NOUN
ajis02-68	80	29	connected	connect	VERB
ajis02-68	80	30	.	.	PUNCT
ajis02-68	81	1	a	a	DET
ajis02-68	81	2	node	node	NOUN
ajis02-68	81	3	that	that	PRON
ajis02-68	81	4	ruins	ruin	VERB
ajis02-68	81	5	connectivity	connectivity	NOUN
ajis02-68	81	6	of	of	ADP
ajis02-68	81	7	the	the	DET
ajis02-68	81	8	graph	graph	NOUN
ajis02-68	81	9	is	be	AUX
ajis02-68	81	10	a	a	DET
ajis02-68	81	11	median	median	NOUN
ajis02-68	81	12	.	.	PUNCT
ajis02-68	82	1	nodes	node	NOUN
ajis02-68	82	2	within	within	ADP
ajis02-68	82	3	a	a	DET
ajis02-68	82	4	strong	strong	ADJ
ajis02-68	82	5	component	component	NOUN
ajis02-68	82	6	are	be	AUX
ajis02-68	82	7	always	always	ADV
ajis02-68	82	8	connected	connect	VERB
ajis02-68	82	9	.	.	PUNCT
ajis02-68	83	1	nodes	node	NOUN
ajis02-68	83	2	representing	represent	VERB
ajis02-68	83	3	strong	strong	ADJ
ajis02-68	83	4	components	component	NOUN
ajis02-68	83	5	of	of	ADP
ajis02-68	83	6	the	the	DET
ajis02-68	83	7	graph	graph	NOUN
ajis02-68	83	8	along	along	ADP
ajis02-68	83	9	with	with	ADP
ajis02-68	83	10	medians	median	NOUN
ajis02-68	83	11	form	form	NOUN
ajis02-68	83	12	sets	set	NOUN
ajis02-68	83	13	of	of	ADP
ajis02-68	83	14	trees	tree	NOUN
ajis02-68	83	15	.	.	PUNCT
ajis02-68	84	1	these	these	DET
ajis02-68	84	2	trees	tree	NOUN
ajis02-68	84	3	are	be	AUX
ajis02-68	84	4	the	the	DET
ajis02-68	84	5	next	next	ADJ
ajis02-68	84	6	layer	layer	NOUN
ajis02-68	84	7	with	with	ADP
ajis02-68	84	8	its	its	PRON
ajis02-68	84	9	separate	separate	ADJ
ajis02-68	84	10	numbering	numbering	NOUN
ajis02-68	84	11	.	.	PUNCT
ajis02-68	85	1	every	every	DET
ajis02-68	85	2	node	node	NOUN
ajis02-68	85	3	of	of	ADP
ajis02-68	85	4	the	the	DET
ajis02-68	85	5	original	original	ADJ
ajis02-68	85	6	graph	graph	NOUN
ajis02-68	85	7	ascribed	ascribe	VERB
ajis02-68	85	8	to	to	ADP
ajis02-68	85	9	the	the	DET
ajis02-68	85	10	pair	pair	NOUN
ajis02-68	85	11	of	of	ADP
ajis02-68	85	12	positions	position	NOUN
ajis02-68	85	13	,	,	PUNCT
ajis02-68	85	14	within	within	ADP
ajis02-68	85	15	the	the	DET
ajis02-68	85	16	component	component	NOUN
ajis02-68	85	17	tree	tree	NOUN
ajis02-68	85	18	.	.	PUNCT
ajis02-68	86	1	the	the	DET
ajis02-68	86	2	procedure	procedure	NOUN
ajis02-68	86	3	of	of	ADP
ajis02-68	86	4	finding	find	VERB
ajis02-68	86	5	whether	whether	SCONJ
ajis02-68	86	6	a	a	DET
ajis02-68	86	7	couple	couple	NOUN
ajis02-68	86	8	nodes	node	NOUN
ajis02-68	86	9	are	be	AUX
ajis02-68	86	10	connected	connect	VERB
ajis02-68	86	11	or	or	CCONJ
ajis02-68	86	12	not	not	PART
ajis02-68	86	13	takes	take	VERB
ajis02-68	86	14	two	two	NUM
ajis02-68	86	15	steps	step	NOUN
ajis02-68	86	16	:	:	PUNCT
ajis02-68	86	17	a	a	X
ajis02-68	86	18	)	)	PUNCT
ajis02-68	86	19	determine	determine	NOUN
ajis02-68	86	20	if	if	SCONJ
ajis02-68	86	21	their	their	PRON
ajis02-68	86	22	component	component	NOUN
ajis02-68	86	23	are	be	AUX
ajis02-68	86	24	connected	connect	VERB
ajis02-68	86	25	and	and	CCONJ
ajis02-68	86	26	if	if	SCONJ
ajis02-68	86	27	they	they	PRON
ajis02-68	86	28	are	be	AUX
ajis02-68	86	29	then	then	ADV
ajis02-68	86	30	b	b	X
ajis02-68	86	31	)	)	PUNCT
ajis02-68	86	32	determine	determine	VERB
ajis02-68	86	33	their	their	PRON
ajis02-68	86	34	relationship	relationship	NOUN
ajis02-68	86	35	within	within	ADP
ajis02-68	86	36	the	the	DET
ajis02-68	86	37	component	component	NOUN
ajis02-68	86	38	.	.	PUNCT
ajis02-68	87	1	graph	graph	NOUN
ajis02-68	87	2	numbering	numbering	NOUN
ajis02-68	87	3	and	and	CCONJ
ajis02-68	87	4	query	query	NOUN
ajis02-68	87	5	processing	processing	NOUN
ajis02-68	87	6	we	we	PRON
ajis02-68	87	7	have	have	AUX
ajis02-68	87	8	proposed	propose	VERB
ajis02-68	87	9	the	the	DET
ajis02-68	87	10	graph	graph	NOUN
ajis02-68	87	11	numbering	number	VERB
ajis02-68	87	12	using	use	VERB
ajis02-68	87	13	indexing	indexing	NOUN
ajis02-68	87	14	for	for	ADP
ajis02-68	87	15	querying	query	VERB
ajis02-68	87	16	connections	connection	NOUN
ajis02-68	87	17	among	among	ADP
ajis02-68	87	18	data	datum	NOUN
ajis02-68	87	19	that	that	PRON
ajis02-68	87	20	exploits	exploit	VERB
ajis02-68	87	21	the	the	DET
ajis02-68	87	22	concept	concept	NOUN
ajis02-68	87	23	of	of	ADP
ajis02-68	87	24	node	node	ADJ
ajis02-68	87	25	position	position	NOUN
ajis02-68	87	26	to	to	PART
ajis02-68	87	27	merge	merge	VERB
ajis02-68	87	28	several	several	ADJ
ajis02-68	87	29	input	input	NOUN
ajis02-68	87	30	lists	list	NOUN
ajis02-68	87	31	in	in	ADP
ajis02-68	87	32	one	one	NUM
ajis02-68	87	33	pass	pass	NOUN
ajis02-68	87	34	.	.	PUNCT
ajis02-68	88	1	as	as	SCONJ
ajis02-68	88	2	it	it	PRON
ajis02-68	88	3	data	datum	NOUN
ajis02-68	88	4	graph	graph	NOUN
ajis02-68	88	5	component	component	NOUN
ajis02-68	88	6	tree	tree	NOUN
ajis02-68	88	7	ajis	ajis	ADV
ajis02-68	88	8	vol	vol	VERB
ajis02-68	88	9	13	13	NUM
ajis02-68	88	10	,	,	PUNCT
ajis02-68	88	11	no	no	INTJ
ajis02-68	88	12	.	.	NOUN
ajis02-68	88	13	1	1	NUM
ajis02-68	88	14	september	september	PROPN
ajis02-68	88	15	2005	2005	NUM
ajis02-68	88	16	154	154	NUM
ajis02-68	88	17	processes	process	NOUN
ajis02-68	88	18	several	several	ADJ
ajis02-68	88	19	binary	binary	ADJ
ajis02-68	88	20	structural	structural	ADJ
ajis02-68	88	21	relationships	relationship	NOUN
ajis02-68	88	22	that	that	PRON
ajis02-68	88	23	form	form	VERB
ajis02-68	88	24	a	a	DET
ajis02-68	88	25	sequence	sequence	NOUN
ajis02-68	88	26	,	,	PUNCT
ajis02-68	88	27	we	we	PRON
ajis02-68	88	28	call	call	VERB
ajis02-68	88	29	it	it	PRON
ajis02-68	88	30	sequence	sequence	NOUN
ajis02-68	88	31	join	join	VERB
ajis02-68	88	32	algorithm	algorithm	NOUN
ajis02-68	88	33	.	.	PUNCT
ajis02-68	89	1	the	the	DET
ajis02-68	89	2	basic	basic	ADJ
ajis02-68	89	3	idea	idea	NOUN
ajis02-68	89	4	of	of	ADP
ajis02-68	89	5	the	the	DET
ajis02-68	89	6	algorithm	algorithm	NOUN
ajis02-68	89	7	is	be	AUX
ajis02-68	89	8	to	to	PART
ajis02-68	89	9	synchronously	synchronously	ADV
ajis02-68	89	10	read	read	VERB
ajis02-68	89	11	input	input	NOUN
ajis02-68	89	12	lists	list	NOUN
ajis02-68	89	13	to	to	PART
ajis02-68	89	14	find	find	VERB
ajis02-68	89	15	first	first	ADJ
ajis02-68	89	16	match	match	NOUN
ajis02-68	89	17	of	of	ADP
ajis02-68	89	18	the	the	DET
ajis02-68	89	19	node	node	ADJ
ajis02-68	89	20	intervals	interval	NOUN
ajis02-68	89	21	and	and	CCONJ
ajis02-68	89	22	put	put	VERB
ajis02-68	89	23	it	it	PRON
ajis02-68	89	24	into	into	ADP
ajis02-68	89	25	the	the	DET
ajis02-68	89	26	result	result	NOUN
ajis02-68	89	27	list	list	NOUN
ajis02-68	89	28	.	.	PUNCT
ajis02-68	90	1	if	if	SCONJ
ajis02-68	90	2	the	the	DET
ajis02-68	90	3	intervals	interval	NOUN
ajis02-68	90	4	in	in	ADP
ajis02-68	90	5	two	two	NUM
ajis02-68	90	6	adjacent	adjacent	ADJ
ajis02-68	90	7	lists	list	NOUN
ajis02-68	90	8	do	do	AUX
ajis02-68	90	9	not	not	PART
ajis02-68	90	10	match	match	VERB
ajis02-68	90	11	,	,	PUNCT
ajis02-68	90	12	based	base	VERB
ajis02-68	90	13	on	on	ADP
ajis02-68	90	14	the	the	DET
ajis02-68	90	15	result	result	NOUN
ajis02-68	90	16	of	of	ADP
ajis02-68	90	17	their	their	PRON
ajis02-68	90	18	comparison	comparison	NOUN
ajis02-68	90	19	,	,	PUNCT
ajis02-68	90	20	the	the	DET
ajis02-68	90	21	record	record	NOUN
ajis02-68	90	22	of	of	ADP
ajis02-68	90	23	one	one	NUM
ajis02-68	90	24	of	of	ADP
ajis02-68	90	25	the	the	DET
ajis02-68	90	26	lists	list	NOUN
ajis02-68	90	27	will	will	AUX
ajis02-68	90	28	be	be	AUX
ajis02-68	90	29	deleted	delete	VERB
ajis02-68	90	30	.	.	PUNCT
ajis02-68	91	1	the	the	DET
ajis02-68	91	2	propagation	propagation	NOUN
ajis02-68	91	3	of	of	ADP
ajis02-68	91	4	changes	change	NOUN
ajis02-68	91	5	goes	go	VERB
ajis02-68	91	6	from	from	ADP
ajis02-68	91	7	the	the	DET
ajis02-68	91	8	last	last	ADJ
ajis02-68	91	9	list	list	NOUN
ajis02-68	91	10	back	back	ADV
ajis02-68	91	11	to	to	ADP
ajis02-68	91	12	first	first	ADJ
ajis02-68	91	13	.	.	PUNCT
ajis02-68	92	1	the	the	DET
ajis02-68	92	2	depth	depth	NOUN
ajis02-68	92	3	of	of	ADP
ajis02-68	92	4	the	the	DET
ajis02-68	92	5	recursion	recursion	NOUN
ajis02-68	92	6	is	be	AUX
ajis02-68	92	7	equal	equal	ADJ
ajis02-68	92	8	to	to	ADP
ajis02-68	92	9	the	the	DET
ajis02-68	92	10	number	number	NOUN
ajis02-68	92	11	of	of	ADP
ajis02-68	92	12	input	input	NOUN
ajis02-68	92	13	lists	list	NOUN
ajis02-68	92	14	,	,	PUNCT
ajis02-68	92	15	which	which	PRON
ajis02-68	92	16	relates	relate	VERB
ajis02-68	92	17	to	to	PART
ajis02-68	92	18	xml	xml	VERB
ajis02-68	92	19	data	datum	NOUN
ajis02-68	92	20	tree	tree	NOUN
ajis02-68	92	21	input	input	NOUN
ajis02-68	92	22	.	.	PUNCT
ajis02-68	93	1	for	for	ADP
ajis02-68	93	2	regular	regular	ADJ
ajis02-68	93	3	path	path	NOUN
ajis02-68	93	4	expression	expression	NOUN
ajis02-68	93	5	a1	a1	PROPN
ajis02-68	93	6	/	/	SYM
ajis02-68	93	7	a2/	a2/	NOUN
ajis02-68	93	8	…	…	PUNCT
ajis02-68	93	9	/an	/an	X
ajis02-68	93	10	,	,	PUNCT
ajis02-68	93	11	both	both	DET
ajis02-68	93	12	approaches	approach	NOUN
ajis02-68	93	13	require	require	VERB
ajis02-68	93	14	n	n	PRON
ajis02-68	93	15	selection	selection	NOUN
ajis02-68	93	16	operators	operator	NOUN
ajis02-68	93	17	resulting	result	VERB
ajis02-68	93	18	in	in	ADP
ajis02-68	93	19	lists	list	NOUN
ajis02-68	93	20	of	of	ADP
ajis02-68	93	21	nodes	node	NOUN
ajis02-68	93	22	a1	a1	NOUN
ajis02-68	93	23	,	,	PUNCT
ajis02-68	93	24	a2	a2	PROPN
ajis02-68	93	25	,	,	PUNCT
ajis02-68	93	26	…	…	PUNCT
ajis02-68	93	27	,	,	PUNCT
ajis02-68	93	28	an	an	DET
ajis02-68	93	29	respectively	respectively	ADV
ajis02-68	93	30	.	.	PUNCT
ajis02-68	94	1	the	the	DET
ajis02-68	94	2	execution	execution	NOUN
ajis02-68	94	3	plans	plan	NOUN
ajis02-68	94	4	for	for	ADP
ajis02-68	94	5	binary	binary	ADJ
ajis02-68	94	6	joins	join	NOUN
ajis02-68	94	7	and	and	CCONJ
ajis02-68	94	8	sequence	sequence	NOUN
ajis02-68	94	9	join	join	NOUN
ajis02-68	94	10	are	be	AUX
ajis02-68	94	11	shown	show	VERB
ajis02-68	94	12	in	in	ADP
ajis02-68	94	13	figure	figure	NOUN
ajis02-68	94	14	2	2	NUM
ajis02-68	94	15	below	below	ADV
ajis02-68	94	16	.	.	PUNCT
ajis02-68	95	1	we	we	PRON
ajis02-68	95	2	consider	consider	VERB
ajis02-68	95	3	the	the	DET
ajis02-68	95	4	total	total	ADJ
ajis02-68	95	5	time	time	NOUN
ajis02-68	95	6	to	to	PART
ajis02-68	95	7	perform	perform	VERB
ajis02-68	95	8	join	join	NOUN
ajis02-68	95	9	operation	operation	NOUN
ajis02-68	95	10	as	as	ADP
ajis02-68	95	11	the	the	DET
ajis02-68	95	12	sum	sum	NOUN
ajis02-68	95	13	of	of	ADP
ajis02-68	95	14	time	time	NOUN
ajis02-68	95	15	needed	need	VERB
ajis02-68	95	16	to	to	PART
ajis02-68	95	17	read	read	VERB
ajis02-68	95	18	input	input	NOUN
ajis02-68	95	19	lists	list	NOUN
ajis02-68	95	20	(	(	PUNCT
ajis02-68	95	21	σ	σ	NOUN
ajis02-68	95	22	)	)	PUNCT
ajis02-68	95	23	and	and	CCONJ
ajis02-68	95	24	time	time	NOUN
ajis02-68	95	25	necessary	necessary	ADJ
ajis02-68	95	26	to	to	PART
ajis02-68	95	27	create	create	VERB
ajis02-68	95	28	output	output	NOUN
ajis02-68	95	29	list	list	NOUN
ajis02-68	95	30	(	(	PUNCT
ajis02-68	95	31	τ	τ	PROPN
ajis02-68	95	32	):	):	PUNCT
ajis02-68	95	33	σ	σ	PROPN
ajis02-68	95	34	+	+	CCONJ
ajis02-68	95	35	τ	τ	PROPN
ajis02-68	95	36	.	.	PROPN
ajis02-68	95	37	figure	figure	NOUN
ajis02-68	95	38	2	2	NUM
ajis02-68	95	39	.	.	PUNCT
ajis02-68	95	40	execution	execution	NOUN
ajis02-68	95	41	plans	plan	NOUN
ajis02-68	95	42	of	of	ADP
ajis02-68	95	43	the	the	DET
ajis02-68	95	44	binary	binary	NOUN
ajis02-68	95	45	and	and	CCONJ
ajis02-68	95	46	sequence	sequence	NOUN
ajis02-68	95	47	joins	join	VERB
ajis02-68	95	48	the	the	DET
ajis02-68	95	49	task	task	NOUN
ajis02-68	95	50	of	of	ADP
ajis02-68	95	51	matching	match	VERB
ajis02-68	95	52	complex	complex	ADJ
ajis02-68	95	53	query	query	NOUN
ajis02-68	95	54	reduces	reduce	VERB
ajis02-68	95	55	the	the	DET
ajis02-68	95	56	performance	performance	NOUN
ajis02-68	95	57	of	of	ADP
ajis02-68	95	58	join	join	NOUN
ajis02-68	95	59	operation	operation	NOUN
ajis02-68	95	60	for	for	ADP
ajis02-68	95	61	each	each	DET
ajis02-68	95	62	binary	binary	ADJ
ajis02-68	95	63	structural	structural	ADJ
ajis02-68	95	64	relationship	relationship	NOUN
ajis02-68	95	65	in	in	ADP
ajis02-68	95	66	query	query	NOUN
ajis02-68	95	67	expression	expression	NOUN
ajis02-68	95	68	.	.	PUNCT
ajis02-68	96	1	for	for	ADP
ajis02-68	96	2	n	n	CCONJ
ajis02-68	96	3	input	input	NOUN
ajis02-68	96	4	lists	list	NOUN
ajis02-68	96	5	of	of	ADP
ajis02-68	96	6	nodes	node	NOUN
ajis02-68	96	7	,	,	PUNCT
ajis02-68	96	8	it	it	PRON
ajis02-68	96	9	causes	cause	VERB
ajis02-68	96	10	creation	creation	NOUN
ajis02-68	96	11	of	of	ADP
ajis02-68	96	12	intermediate	intermediate	ADJ
ajis02-68	96	13	lists	list	NOUN
ajis02-68	96	14	of	of	ADP
ajis02-68	96	15	nodes	node	NOUN
ajis02-68	96	16	.	.	PUNCT
ajis02-68	97	1	the	the	DET
ajis02-68	97	2	next	next	ADJ
ajis02-68	97	3	step	step	NOUN
ajis02-68	97	4	is	be	AUX
ajis02-68	97	5	to	to	PART
ajis02-68	97	6	perform	perform	VERB
ajis02-68	97	7	binary	binary	ADJ
ajis02-68	97	8	join	join	NOUN
ajis02-68	97	9	operation	operation	NOUN
ajis02-68	97	10	over	over	ADP
ajis02-68	97	11	the	the	DET
ajis02-68	97	12	intermediate	intermediate	ADJ
ajis02-68	97	13	lists	list	NOUN
ajis02-68	97	14	.	.	PUNCT
ajis02-68	98	1	the	the	DET
ajis02-68	98	2	latter	latter	ADJ
ajis02-68	98	3	will	will	AUX
ajis02-68	98	4	be	be	AUX
ajis02-68	98	5	applied	apply	VERB
ajis02-68	98	6	until	until	SCONJ
ajis02-68	98	7	the	the	DET
ajis02-68	98	8	result	result	NOUN
ajis02-68	98	9	is	be	AUX
ajis02-68	98	10	the	the	DET
ajis02-68	98	11	only	only	ADJ
ajis02-68	98	12	one	one	NUM
ajis02-68	98	13	,	,	PUNCT
ajis02-68	98	14	in	in	ADP
ajis02-68	98	15	result	result	NOUN
ajis02-68	98	16	list	list	NOUN
ajis02-68	98	17	.	.	PUNCT
ajis02-68	99	1	thus	thus	ADV
ajis02-68	99	2	,	,	PUNCT
ajis02-68	99	3	the	the	DET
ajis02-68	99	4	whole	whole	ADJ
ajis02-68	99	5	number	number	NOUN
ajis02-68	99	6	of	of	ADP
ajis02-68	99	7	intermediate	intermediate	ADJ
ajis02-68	99	8	list	list	NOUN
ajis02-68	99	9	(	(	PUNCT
ajis02-68	99	10	including	include	VERB
ajis02-68	99	11	the	the	DET
ajis02-68	99	12	result	result	NOUN
ajis02-68	99	13	list	list	NOUN
ajis02-68	99	14	)	)	PUNCT
ajis02-68	99	15	is	be	AUX
ajis02-68	99	16	n	n	PRON
ajis02-68	99	17	–	–	PUNCT
ajis02-68	99	18	1	1	X
ajis02-68	99	19	.	.	X
ajis02-68	100	1	in	in	ADP
ajis02-68	100	2	figure	figure	NOUN
ajis02-68	100	3	2	2	NUM
ajis02-68	100	4	a	a	X
ajis02-68	100	5	)	)	PUNCT
ajis02-68	100	6	these	these	DET
ajis02-68	100	7	lists	list	NOUN
ajis02-68	100	8	are	be	AUX
ajis02-68	100	9	denoted	denote	VERB
ajis02-68	100	10	as	as	ADP
ajis02-68	100	11	an+1	an+1	NOUN
ajis02-68	100	12	,	,	PUNCT
ajis02-68	100	13	…	…	PUNCT
ajis02-68	100	14	,	,	PUNCT
ajis02-68	100	15	a2n–1	a2n–1	PROPN
ajis02-68	100	16	.	.	PUNCT
ajis02-68	101	1	the	the	DET
ajis02-68	101	2	total	total	ADJ
ajis02-68	101	3	time	time	NOUN
ajis02-68	101	4	necessary	necessary	ADJ
ajis02-68	101	5	to	to	PART
ajis02-68	101	6	perform	perform	VERB
ajis02-68	101	7	multiple	multiple	ADJ
ajis02-68	101	8	pair	pair	NOUN
ajis02-68	101	9	wise	wise	ADJ
ajis02-68	101	10	join	join	NOUN
ajis02-68	101	11	is	be	AUX
ajis02-68	101	12	:	:	PUNCT
ajis02-68	101	13	the	the	DET
ajis02-68	101	14	τi	τi	NOUN
ajis02-68	101	15	and	and	CCONJ
ajis02-68	101	16	σi	σi	PRON
ajis02-68	101	17	is	be	AUX
ajis02-68	101	18	the	the	DET
ajis02-68	101	19	time	time	NOUN
ajis02-68	101	20	required	require	VERB
ajis02-68	101	21	to	to	PART
ajis02-68	101	22	create	create	VERB
ajis02-68	101	23	and	and	CCONJ
ajis02-68	101	24	read	read	VERB
ajis02-68	101	25	list	list	NOUN
ajis02-68	101	26	i	i	PRON
ajis02-68	101	27	respectively	respectively	ADV
ajis02-68	101	28	.	.	PUNCT
ajis02-68	102	1	the	the	DET
ajis02-68	102	2	sequence	sequence	NOUN
ajis02-68	102	3	join	join	VERB
ajis02-68	102	4	reads	read	VERB
ajis02-68	102	5	input	input	NOUN
ajis02-68	102	6	lists	list	NOUN
ajis02-68	102	7	a1	a1	VERB
ajis02-68	102	8	,	,	PUNCT
ajis02-68	102	9	…	…	PUNCT
ajis02-68	102	10	,	,	PUNCT
ajis02-68	102	11	an	an	PRON
ajis02-68	102	12	and	and	CCONJ
ajis02-68	102	13	project	project	VERB
ajis02-68	102	14	the	the	DET
ajis02-68	102	15	result	result	NOUN
ajis02-68	102	16	list	list	NOUN
ajis02-68	102	17	a2n–1	a2n–1	PROPN
ajis02-68	102	18	,	,	PUNCT
ajis02-68	102	19	as	as	SCONJ
ajis02-68	102	20	shown	show	VERB
ajis02-68	102	21	in	in	ADP
ajis02-68	102	22	figure	figure	NOUN
ajis02-68	102	23	2	2	NUM
ajis02-68	102	24	b	b	NOUN
ajis02-68	102	25	)	)	PUNCT
ajis02-68	102	26	.	.	PUNCT
ajis02-68	103	1	the	the	DET
ajis02-68	103	2	total	total	ADJ
ajis02-68	103	3	time	time	NOUN
ajis02-68	103	4	necessary	necessary	ADJ
ajis02-68	103	5	to	to	PART
ajis02-68	103	6	perform	perform	VERB
ajis02-68	103	7	sequence	sequence	NOUN
ajis02-68	103	8	join	join	NOUN
ajis02-68	103	9	is	be	AUX
ajis02-68	103	10	:	:	PUNCT
ajis02-68	103	11	the	the	DET
ajis02-68	103	12	σi	σi	NOUN
ajis02-68	103	13	is	be	AUX
ajis02-68	103	14	time	time	NOUN
ajis02-68	103	15	required	require	VERB
ajis02-68	103	16	to	to	PART
ajis02-68	103	17	read	read	VERB
ajis02-68	103	18	input	input	NOUN
ajis02-68	103	19	lists	list	NOUN
ajis02-68	103	20	,	,	PUNCT
ajis02-68	103	21	and	and	CCONJ
ajis02-68	103	22	τ2n–1	τ2n–1	PROPN
ajis02-68	103	23	is	be	AUX
ajis02-68	103	24	time	time	NOUN
ajis02-68	103	25	needed	need	VERB
ajis02-68	103	26	to	to	PART
ajis02-68	103	27	create	create	VERB
ajis02-68	103	28	the	the	DET
ajis02-68	103	29	result	result	NOUN
ajis02-68	103	30	table	table	NOUN
ajis02-68	103	31	.	.	PUNCT
ajis02-68	104	1	…	…	PUNCT
ajis02-68	104	2	a1	a1	NOUN
ajis02-68	104	3	a2	a2	PROPN
ajis02-68	104	4	an+1	an+1	PROPN
ajis02-68	104	5	a2n–1	a2n–1	PROPN
ajis02-68	104	6	…	…	PUNCT
ajis02-68	104	7	an–1	an–1	PROPN
ajis02-68	104	8	an	an	DET
ajis02-68	104	9	an+½n	an+½n	PROPN
ajis02-68	104	10	…	…	PUNCT
ajis02-68	104	11	…	…	PUNCT
ajis02-68	104	12	…	…	PUNCT
ajis02-68	104	13	a1	a1	NOUN
ajis02-68	104	14	a2	a2	PROPN
ajis02-68	104	15	a2n–1	a2n–1	PROPN
ajis02-68	105	1	an–1	an–1	DET
ajis02-68	105	2	an	an	DET
ajis02-68	105	3	a	a	NOUN
ajis02-68	105	4	)	)	PUNCT
ajis02-68	105	5	b	b	NOUN
ajis02-68	105	6	)	)	PUNCT
ajis02-68	105	7	ajis	ajis	ADV
ajis02-68	105	8	vol	vol	VERB
ajis02-68	105	9	13	13	NUM
ajis02-68	105	10	,	,	PUNCT
ajis02-68	105	11	no	no	INTJ
ajis02-68	105	12	.	.	NOUN
ajis02-68	105	13	1	1	NUM
ajis02-68	105	14	september	september	PROPN
ajis02-68	105	15	2005	2005	NUM
ajis02-68	105	16	155	155	NUM
ajis02-68	105	17	the	the	DET
ajis02-68	105	18	parameters	parameter	NOUN
ajis02-68	105	19	τi	τi	VERB
ajis02-68	106	1	and	and	CCONJ
ajis02-68	106	2	σi	σi	PRON
ajis02-68	106	3	depend	depend	VERB
ajis02-68	106	4	on	on	ADP
ajis02-68	106	5	the	the	DET
ajis02-68	106	6	capacity	capacity	NOUN
ajis02-68	106	7	of	of	ADP
ajis02-68	106	8	the	the	DET
ajis02-68	106	9	list	list	NOUN
ajis02-68	106	10	i.	i.	NOUN
ajis02-68	106	11	if	if	SCONJ
ajis02-68	106	12	the	the	DET
ajis02-68	106	13	number	number	NOUN
ajis02-68	106	14	of	of	ADP
ajis02-68	106	15	nodes	node	NOUN
ajis02-68	106	16	in	in	ADP
ajis02-68	106	17	each	each	DET
ajis02-68	106	18	list	list	NOUN
ajis02-68	106	19	is	be	AUX
ajis02-68	106	20	comparable	comparable	ADJ
ajis02-68	106	21	then	then	ADV
ajis02-68	106	22	we	we	PRON
ajis02-68	106	23	can	can	AUX
ajis02-68	106	24	assume	assume	VERB
ajis02-68	106	25	the	the	DET
ajis02-68	106	26	times	time	NOUN
ajis02-68	106	27	to	to	PART
ajis02-68	106	28	create	create	VERB
ajis02-68	106	29	and	and	CCONJ
ajis02-68	106	30	read	read	VERB
ajis02-68	106	31	list	list	NOUN
ajis02-68	106	32	are	be	AUX
ajis02-68	106	33	equal	equal	ADJ
ajis02-68	106	34	.	.	PUNCT
ajis02-68	107	1	the	the	DET
ajis02-68	107	2	time	time	NOUN
ajis02-68	107	3	differences	difference	NOUN
ajis02-68	107	4	between	between	ADP
ajis02-68	107	5	the	the	DET
ajis02-68	107	6	two	two	NUM
ajis02-68	107	7	approaches	approach	NOUN
ajis02-68	107	8	in	in	ADP
ajis02-68	107	9	figure	figure	NOUN
ajis02-68	107	10	2	2	NUM
ajis02-68	107	11	above	above	ADV
ajis02-68	107	12	is	be	AUX
ajis02-68	107	13	illustrated	illustrate	VERB
ajis02-68	107	14	in	in	ADP
ajis02-68	107	15	figure	figure	NOUN
ajis02-68	107	16	3	3	NUM
ajis02-68	107	17	below	below	ADV
ajis02-68	107	18	:	:	PUNCT
ajis02-68	107	19	figure	figure	VERB
ajis02-68	107	20	3	3	NUM
ajis02-68	107	21	.	.	NOUN
ajis02-68	107	22	time	time	NOUN
ajis02-68	107	23	differences	difference	NOUN
ajis02-68	107	24	however	however	ADV
ajis02-68	107	25	,	,	PUNCT
ajis02-68	107	26	the	the	DET
ajis02-68	107	27	parameters	parameter	NOUN
ajis02-68	107	28	of	of	ADP
ajis02-68	107	29	τi	τi	NOUN
ajis02-68	108	1	and	and	CCONJ
ajis02-68	108	2	σi	σi	PRON
ajis02-68	108	3	depend	depend	VERB
ajis02-68	108	4	on	on	ADP
ajis02-68	108	5	the	the	DET
ajis02-68	108	6	capacity	capacity	NOUN
ajis02-68	108	7	of	of	ADP
ajis02-68	108	8	the	the	DET
ajis02-68	108	9	list	list	NOUN
ajis02-68	108	10	i.	i.	NOUN
ajis02-68	108	11	if	if	SCONJ
ajis02-68	108	12	the	the	DET
ajis02-68	108	13	number	number	NOUN
ajis02-68	108	14	of	of	ADP
ajis02-68	108	15	nodes	node	NOUN
ajis02-68	108	16	in	in	ADP
ajis02-68	108	17	each	each	DET
ajis02-68	108	18	list	list	NOUN
ajis02-68	108	19	is	be	AUX
ajis02-68	108	20	comparable	comparable	ADJ
ajis02-68	108	21	then	then	ADV
ajis02-68	108	22	we	we	PRON
ajis02-68	108	23	can	can	AUX
ajis02-68	108	24	assume	assume	VERB
ajis02-68	108	25	the	the	DET
ajis02-68	108	26	times	time	NOUN
ajis02-68	108	27	to	to	PART
ajis02-68	108	28	create	create	VERB
ajis02-68	108	29	and	and	CCONJ
ajis02-68	108	30	read	read	VERB
ajis02-68	108	31	list	list	NOUN
ajis02-68	108	32	are	be	AUX
ajis02-68	108	33	equal	equal	ADJ
ajis02-68	108	34	:	:	PUNCT
ajis02-68	108	35	∀i	∀i	NOUN
ajis02-68	108	36	,	,	PUNCT
ajis02-68	108	37	i	i	PRON
ajis02-68	108	38	=	=	NOUN
ajis02-68	108	39	1,	1,	NUM
ajis02-68	108	40	…	…	PUNCT
ajis02-68	108	41	,n	,n	NOUN
ajis02-68	108	42	;	;	PUNCT
ajis02-68	108	43	σi	σi	PROPN
ajis02-68	108	44	=	=	SYM
ajis02-68	108	45	σ	σ	PROPN
ajis02-68	108	46	,	,	PUNCT
ajis02-68	108	47	τi	τi	VERB
ajis02-68	108	48	=	=	SYM
ajis02-68	108	49	τ	τ	PROPN
ajis02-68	108	50	.	.	PROPN
ajis02-68	108	51	time	time	NOUN
ajis02-68	108	52	cost	cost	NOUN
ajis02-68	108	53	functions	function	NOUN
ajis02-68	108	54	of	of	ADP
ajis02-68	108	55	the	the	DET
ajis02-68	108	56	algorithms	algorithms	NOUN
ajis02-68	108	57	is	be	AUX
ajis02-68	108	58	:	:	PUNCT
ajis02-68	108	59	(	(	PUNCT
ajis02-68	108	60	σ	σ	NOUN
ajis02-68	108	61	+	+	X
ajis02-68	108	62	τ)(n	τ)(n	X
ajis02-68	108	63	–	–	PUNCT
ajis02-68	108	64	2	2	NUM
ajis02-68	108	65	)	)	PUNCT
ajis02-68	108	66	,	,	PUNCT
ajis02-68	108	67	(	(	PUNCT
ajis02-68	108	68	1a	1a	X
ajis02-68	108	69	)	)	PUNCT
ajis02-68	108	70	where	where	SCONJ
ajis02-68	108	71	τ	τ	PROPN
ajis02-68	108	72	and	and	CCONJ
ajis02-68	108	73	σ	σ	PROPN
ajis02-68	108	74	is	be	AUX
ajis02-68	108	75	average	average	ADJ
ajis02-68	108	76	time	time	NOUN
ajis02-68	108	77	required	require	VERB
ajis02-68	108	78	to	to	PART
ajis02-68	108	79	create	create	VERB
ajis02-68	108	80	an	an	DET
ajis02-68	108	81	output	output	NOUN
ajis02-68	108	82	and	and	CCONJ
ajis02-68	108	83	read	read	VERB
ajis02-68	108	84	an	an	DET
ajis02-68	108	85	input	input	NOUN
ajis02-68	108	86	list	list	NOUN
ajis02-68	108	87	respectively	respectively	ADV
ajis02-68	108	88	,	,	PUNCT
ajis02-68	108	89	n	n	PRON
ajis02-68	108	90	is	be	AUX
ajis02-68	108	91	number	number	NOUN
ajis02-68	108	92	of	of	ADP
ajis02-68	108	93	original	original	ADJ
ajis02-68	108	94	input	input	NOUN
ajis02-68	108	95	lists	list	NOUN
ajis02-68	108	96	.	.	PUNCT
ajis02-68	109	1	the	the	DET
ajis02-68	109	2	figure	figure	NOUN
ajis02-68	109	3	4	4	NUM
ajis02-68	109	4	shows	show	VERB
ajis02-68	109	5	the	the	DET
ajis02-68	109	6	time	time	NOUN
ajis02-68	109	7	cost	cost	NOUN
ajis02-68	109	8	graphs	graph	NOUN
ajis02-68	109	9	of	of	ADP
ajis02-68	109	10	sequence	sequence	NOUN
ajis02-68	109	11	join	join	VERB
ajis02-68	109	12	algorithm	algorithm	NOUN
ajis02-68	109	13	performance	performance	NOUN
ajis02-68	109	14	.	.	PUNCT
ajis02-68	110	1	figure	figure	NOUN
ajis02-68	110	2	4	4	NUM
ajis02-68	110	3	.	.	NOUN
ajis02-68	110	4	time	time	NOUN
ajis02-68	110	5	difference	difference	NOUN
ajis02-68	110	6	between	between	ADP
ajis02-68	110	7	the	the	DET
ajis02-68	110	8	binary	binary	ADJ
ajis02-68	110	9	and	and	CCONJ
ajis02-68	110	10	sequence	sequence	NOUN
ajis02-68	110	11	joins	join	VERB
ajis02-68	110	12	the	the	DET
ajis02-68	110	13	key	key	ADJ
ajis02-68	110	14	idea	idea	NOUN
ajis02-68	110	15	of	of	ADP
ajis02-68	110	16	our	our	PRON
ajis02-68	110	17	proposed	propose	VERB
ajis02-68	110	18	framework	framework	NOUN
ajis02-68	110	19	is	be	AUX
ajis02-68	110	20	to	to	PART
ajis02-68	110	21	consider	consider	VERB
ajis02-68	110	22	the	the	DET
ajis02-68	110	23	original	original	ADJ
ajis02-68	110	24	database	database	NOUN
ajis02-68	110	25	as	as	ADP
ajis02-68	110	26	a	a	DET
ajis02-68	110	27	graph	graph	NOUN
ajis02-68	110	28	:	:	PUNCT
ajis02-68	110	29	•	•	NOUN
ajis02-68	110	30	both	both	DET
ajis02-68	110	31	objects	object	NOUN
ajis02-68	110	32	and	and	CCONJ
ajis02-68	110	33	relations	relation	NOUN
ajis02-68	110	34	of	of	ADP
ajis02-68	110	35	the	the	DET
ajis02-68	110	36	database	database	NOUN
ajis02-68	110	37	are	be	AUX
ajis02-68	110	38	represented	represent	VERB
ajis02-68	110	39	as	as	ADP
ajis02-68	110	40	graph	graph	NOUN
ajis02-68	110	41	nodes	node	NOUN
ajis02-68	110	42	–	–	PUNCT
ajis02-68	110	43	this	this	PRON
ajis02-68	110	44	provides	provide	VERB
ajis02-68	110	45	a	a	DET
ajis02-68	110	46	unified	unified	ADJ
ajis02-68	110	47	way	way	NOUN
ajis02-68	110	48	for	for	ADP
ajis02-68	110	49	their	their	PRON
ajis02-68	110	50	arrangement	arrangement	NOUN
ajis02-68	110	51	,	,	PUNCT
ajis02-68	110	52	indexing	indexing	NOUN
ajis02-68	110	53	and	and	CCONJ
ajis02-68	110	54	storage	storage	NOUN
ajis02-68	110	55	.	.	PUNCT
ajis02-68	111	1	•	•	NUM
ajis02-68	111	2	the	the	DET
ajis02-68	111	3	initial	initial	ADJ
ajis02-68	111	4	graph	graph	NOUN
ajis02-68	111	5	is	be	AUX
ajis02-68	111	6	direct	direct	ADJ
ajis02-68	111	7	and	and	CCONJ
ajis02-68	111	8	,	,	PUNCT
ajis02-68	111	9	generally	generally	ADV
ajis02-68	111	10	,	,	PUNCT
ajis02-68	111	11	cyclic	cyclic	ADJ
ajis02-68	111	12	–	–	PUNCT
ajis02-68	111	13	we	we	PRON
ajis02-68	111	14	convert	convert	VERB
ajis02-68	111	15	it	it	PRON
ajis02-68	111	16	into	into	ADP
ajis02-68	111	17	a	a	DET
ajis02-68	111	18	directed	direct	VERB
ajis02-68	111	19	cyclic	cyclic	NOUN
ajis02-68	111	20	graph	graph	NOUN
ajis02-68	111	21	by	by	ADP
ajis02-68	111	22	giving	give	VERB
ajis02-68	111	23	database	database	NOUN
ajis02-68	111	24	relations	relation	NOUN
ajis02-68	111	25	status	status	NOUN
ajis02-68	111	26	of	of	ADP
ajis02-68	111	27	nodes	node	NOUN
ajis02-68	111	28	,	,	PUNCT
ajis02-68	111	29	then	then	ADV
ajis02-68	111	30	rearranging	rearrange	VERB
ajis02-68	111	31	nodes	node	NOUN
ajis02-68	111	32	so	so	SCONJ
ajis02-68	111	33	the	the	DET
ajis02-68	111	34	graph	graph	NOUN
ajis02-68	111	35	is	be	AUX
ajis02-68	111	36	rooted	root	VERB
ajis02-68	111	37	.	.	PUNCT
ajis02-68	112	1	•	•	NUM
ajis02-68	112	2	every	every	DET
ajis02-68	112	3	node	node	NOUN
ajis02-68	112	4	of	of	ADP
ajis02-68	112	5	the	the	DET
ajis02-68	112	6	graph	graph	NOUN
ajis02-68	112	7	ascribed	ascribe	VERB
ajis02-68	112	8	with	with	ADP
ajis02-68	112	9	a	a	DET
ajis02-68	112	10	couple	couple	NOUN
ajis02-68	112	11	of	of	ADP
ajis02-68	112	12	ordering	order	VERB
ajis02-68	112	13	numbers	number	NOUN
ajis02-68	112	14	of	of	ADP
ajis02-68	112	15	the	the	DET
ajis02-68	112	16	graph	graph	NOUN
ajis02-68	112	17	and	and	CCONJ
ajis02-68	112	18	post	post	ADJ
ajis02-68	112	19	-	-	ADJ
ajis02-68	112	20	order	order	NOUN
ajis02-68	112	21	graph	graph	NOUN
ajis02-68	112	22	traversals	traversal	NOUN
ajis02-68	112	23	analogous	analogous	ADJ
ajis02-68	112	24	to	to	ADP
ajis02-68	112	25	a	a	DET
ajis02-68	112	26	tree	tree	NOUN
ajis02-68	112	27	traversals	traversal	NOUN
ajis02-68	112	28	.	.	PUNCT
ajis02-68	113	1	1	1	NUM
ajis02-68	113	2	2	2	NUM
ajis02-68	113	3	3	3	NUM
ajis02-68	113	4	4	4	NUM
ajis02-68	113	5	5(σ+τ	5(σ+τ	NUM
ajis02-68	113	6	)	)	PUNCT
ajis02-68	113	7	(	(	PUNCT
ajis02-68	113	8	σ+τ	σ+τ	NUM
ajis02-68	113	9	)	)	PUNCT
ajis02-68	113	10	2(σ+τ	2(σ+τ	NUM
ajis02-68	113	11	)	)	PUNCT
ajis02-68	113	12	3(σ+τ	3(σ+τ	NUM
ajis02-68	113	13	)	)	PUNCT
ajis02-68	113	14	4(σ+τ	4(σ+τ	PROPN
ajis02-68	113	15	)	)	PUNCT
ajis02-68	113	16	(	(	PUNCT
ajis02-68	113	17	σn+τ	σn+τ	X
ajis02-68	113	18	)	)	PUNCT
ajis02-68	113	19	sequence	sequence	NOUN
ajis02-68	113	20	join	join	NOUN
ajis02-68	113	21	(	(	PUNCT
ajis02-68	113	22	2σ+τ)(n–1	2σ+τ)(n–1	NUM
ajis02-68	113	23	)	)	PUNCT
ajis02-68	113	24	binary	binary	NOUN
ajis02-68	113	25	join	join	VERB
ajis02-68	114	1	ti	ti	PROPN
ajis02-68	114	2	m	m	NOUN
ajis02-68	114	3	e	e	NOUN
ajis02-68	114	4	number	number	NOUN
ajis02-68	114	5	of	of	ADP
ajis02-68	114	6	lists	list	NOUN
ajis02-68	114	7	ajis	ajis	ADV
ajis02-68	114	8	vol	vol	VERB
ajis02-68	114	9	13	13	NUM
ajis02-68	114	10	,	,	PUNCT
ajis02-68	114	11	no	no	INTJ
ajis02-68	114	12	.	.	NOUN
ajis02-68	114	13	1	1	NUM
ajis02-68	114	14	september	september	PROPN
ajis02-68	114	15	2005	2005	NUM
ajis02-68	114	16	156	156	NUM
ajis02-68	114	17	figure	figure	NOUN
ajis02-68	114	18	5	5	NUM
ajis02-68	114	19	.	.	PUNCT
ajis02-68	114	20	framework	framework	NOUN
ajis02-68	114	21	of	of	ADP
ajis02-68	114	22	treating	treat	VERB
ajis02-68	114	23	relational	relational	ADJ
ajis02-68	114	24	data	datum	NOUN
ajis02-68	114	25	as	as	ADP
ajis02-68	114	26	semi	semi	ADJ
ajis02-68	114	27	-	-	ADJ
ajis02-68	114	28	structured	structured	ADJ
ajis02-68	114	29	figure	figure	NOUN
ajis02-68	114	30	5	5	NUM
ajis02-68	114	31	is	be	AUX
ajis02-68	114	32	performed	perform	VERB
ajis02-68	114	33	has	have	VERB
ajis02-68	114	34	a	a	DET
ajis02-68	114	35	pre	pre	ADJ
ajis02-68	114	36	-	-	ADJ
ajis02-68	114	37	processing	processing	ADJ
ajis02-68	114	38	stage	stage	NOUN
ajis02-68	114	39	of	of	ADP
ajis02-68	114	40	storing	store	VERB
ajis02-68	114	41	new	new	ADJ
ajis02-68	114	42	data	datum	NOUN
ajis02-68	114	43	or	or	CCONJ
ajis02-68	114	44	wrapping	wrap	VERB
ajis02-68	114	45	a	a	DET
ajis02-68	114	46	legacy	legacy	NOUN
ajis02-68	114	47	system	system	NOUN
ajis02-68	114	48	.	.	PUNCT
ajis02-68	115	1	the	the	DET
ajis02-68	115	2	query	query	NOUN
ajis02-68	115	3	stage	stage	NOUN
ajis02-68	115	4	exploits	exploit	VERB
ajis02-68	115	5	graph	graph	NOUN
ajis02-68	115	6	numbering	number	VERB
ajis02-68	115	7	for	for	ADP
ajis02-68	115	8	fast	fast	ADJ
ajis02-68	115	9	selection	selection	NOUN
ajis02-68	115	10	of	of	ADP
ajis02-68	115	11	all	all	DET
ajis02-68	115	12	intermediate	intermediate	ADJ
ajis02-68	115	13	nodes	node	NOUN
ajis02-68	115	14	that	that	PRON
ajis02-68	115	15	constitute	constitute	VERB
ajis02-68	115	16	paths	path	NOUN
ajis02-68	115	17	between	between	ADP
ajis02-68	115	18	nodes	node	NOUN
ajis02-68	115	19	.	.	PUNCT
ajis02-68	116	1	prototype	prototype	NOUN
ajis02-68	116	2	system	system	NOUN
ajis02-68	116	3	we	we	PRON
ajis02-68	116	4	implemented	implement	VERB
ajis02-68	116	5	a	a	DET
ajis02-68	116	6	prototype	prototype	NOUN
ajis02-68	116	7	system	system	NOUN
ajis02-68	116	8	for	for	ADP
ajis02-68	116	9	storing	storing	NOUN
ajis02-68	116	10	,	,	PUNCT
ajis02-68	116	11	indexing	indexing	NOUN
ajis02-68	116	12	,	,	PUNCT
ajis02-68	116	13	and	and	CCONJ
ajis02-68	116	14	querying	query	VERB
ajis02-68	116	15	connections	connection	NOUN
ajis02-68	116	16	among	among	ADP
ajis02-68	116	17	data	datum	NOUN
ajis02-68	116	18	.	.	PUNCT
ajis02-68	117	1	the	the	DET
ajis02-68	117	2	system	system	NOUN
ajis02-68	117	3	works	work	VERB
ajis02-68	117	4	as	as	ADP
ajis02-68	117	5	a	a	DET
ajis02-68	117	6	wrapper	wrapper	NOUN
ajis02-68	117	7	for	for	ADP
ajis02-68	117	8	an	an	DET
ajis02-68	117	9	existing	exist	VERB
ajis02-68	117	10	relational	relational	ADJ
ajis02-68	117	11	database	database	NOUN
ajis02-68	117	12	.	.	PUNCT
ajis02-68	118	1	the	the	DET
ajis02-68	118	2	real	real	ADJ
ajis02-68	118	3	world	world	NOUN
ajis02-68	118	4	data	datum	NOUN
ajis02-68	118	5	set	set	NOUN
ajis02-68	118	6	has	have	AUX
ajis02-68	118	7	been	be	AUX
ajis02-68	118	8	used	use	VERB
ajis02-68	118	9	as	as	ADP
ajis02-68	118	10	an	an	DET
ajis02-68	118	11	input	input	NOUN
ajis02-68	118	12	of	of	ADP
ajis02-68	118	13	the	the	DET
ajis02-68	118	14	prototype	prototype	NOUN
ajis02-68	118	15	.	.	PUNCT
ajis02-68	119	1	we	we	PRON
ajis02-68	119	2	used	use	VERB
ajis02-68	119	3	a	a	DET
ajis02-68	119	4	subset	subset	NOUN
ajis02-68	119	5	of	of	ADP
ajis02-68	119	6	over	over	ADP
ajis02-68	119	7	20,000	20,000	NUM
ajis02-68	119	8	companies	company	NOUN
ajis02-68	119	9	from	from	ADP
ajis02-68	119	10	a	a	DET
ajis02-68	119	11	fame	fame	NOUN
ajis02-68	119	12	(	(	PUNCT
ajis02-68	119	13	financial	financial	ADJ
ajis02-68	119	14	analysis	analysis	NOUN
ajis02-68	119	15	made	make	VERB
ajis02-68	119	16	easy	easy	ADJ
ajis02-68	119	17	)	)	PUNCT
ajis02-68	119	18	database	database	NOUN
ajis02-68	119	19	.	.	PUNCT
ajis02-68	120	1	the	the	DET
ajis02-68	120	2	fame	fame	PROPN
ajis02-68	120	3	database	database	NOUN
ajis02-68	120	4	contains	contain	VERB
ajis02-68	120	5	financial	financial	ADJ
ajis02-68	120	6	and	and	CCONJ
ajis02-68	120	7	statistical	statistical	ADJ
ajis02-68	120	8	information	information	NOUN
ajis02-68	120	9	about	about	ADP
ajis02-68	120	10	all	all	DET
ajis02-68	120	11	companies	company	NOUN
ajis02-68	120	12	in	in	ADP
ajis02-68	120	13	uk	uk	PROPN
ajis02-68	120	14	.	.	PUNCT
ajis02-68	121	1	we	we	PRON
ajis02-68	121	2	have	have	AUX
ajis02-68	121	3	limited	limit	VERB
ajis02-68	121	4	our	our	PRON
ajis02-68	121	5	objects	object	NOUN
ajis02-68	121	6	to	to	ADP
ajis02-68	121	7	company	company	NOUN
ajis02-68	121	8	’s	’s	PART
ajis02-68	121	9	directors	director	NOUN
ajis02-68	121	10	,	,	PUNCT
ajis02-68	121	11	shareholders	shareholder	NOUN
ajis02-68	121	12	,	,	PUNCT
ajis02-68	121	13	postcodes	postcode	NOUN
ajis02-68	121	14	and	and	CCONJ
ajis02-68	121	15	ownership	ownership	NOUN
ajis02-68	121	16	data	datum	NOUN
ajis02-68	121	17	.	.	PUNCT
ajis02-68	122	1	the	the	DET
ajis02-68	122	2	prototype	prototype	NOUN
ajis02-68	122	3	screenshot	screenshot	NOUN
ajis02-68	122	4	shows	show	VERB
ajis02-68	122	5	the	the	DET
ajis02-68	122	6	sample	sample	NOUN
ajis02-68	122	7	query	query	NOUN
ajis02-68	122	8	of	of	ADP
ajis02-68	122	9	the	the	DET
ajis02-68	122	10	semi	semi	ADJ
ajis02-68	122	11	-	-	ADJ
ajis02-68	122	12	structured	structured	ADJ
ajis02-68	122	13	data	datum	NOUN
ajis02-68	122	14	to	to	PART
ajis02-68	122	15	find	find	VERB
ajis02-68	122	16	connection	connection	NOUN
ajis02-68	122	17	between	between	ADP
ajis02-68	122	18	a	a	DET
ajis02-68	122	19	person	person	NOUN
ajis02-68	122	20	and	and	CCONJ
ajis02-68	122	21	a	a	DET
ajis02-68	122	22	company	company	NOUN
ajis02-68	122	23	(	(	PUNCT
ajis02-68	122	24	see	see	VERB
ajis02-68	122	25	table	table	NOUN
ajis02-68	122	26	1	1	NUM
ajis02-68	122	27	for	for	ADP
ajis02-68	122	28	sample	sample	NOUN
ajis02-68	122	29	queries	query	NOUN
ajis02-68	122	30	)	)	PUNCT
ajis02-68	122	31	.	.	PUNCT
ajis02-68	123	1	query	query	NOUN
ajis02-68	123	2	xquery	xquery	PROPN
ajis02-68	123	3	expression	expression	NOUN
ajis02-68	123	4	dataset	dataset	VERB
ajis02-68	123	5	rpe	rpe	PROPN
ajis02-68	123	6	length	length	PROPN
ajis02-68	123	7	q1	q1	PROPN
ajis02-68	123	8	/fmdatabase	/fmdatabase	PROPN
ajis02-68	123	9	/	/	SYM
ajis02-68	123	10	fccamradio	fccamradio	NOUN
ajis02-68	123	11	/	/	SYM
ajis02-68	123	12	address	address	NOUN
ajis02-68	123	13	/	/	SYM
ajis02-68	123	14	city	city	NOUN
ajis02-68	123	15	ham	ham	NOUN
ajis02-68	123	16	-	-	PUNCT
ajis02-68	123	17	radio	radio	NOUN
ajis02-68	123	18	3	3	NUM
ajis02-68	123	19	q2	q2	NOUN
ajis02-68	123	20	/play	/play	PROPN
ajis02-68	123	21	/	/	SYM
ajis02-68	123	22	act	act	PROPN
ajis02-68	123	23	/	/	SYM
ajis02-68	123	24	speech	speech	NOUN
ajis02-68	123	25	/	/	SYM
ajis02-68	123	26	line	line	NOUN
ajis02-68	123	27	shakespeare	shakespeare	PROPN
ajis02-68	123	28	4	4	NUM
ajis02-68	123	29	q3	q3	NOUN
ajis02-68	123	30	/country	/country	NOUN
ajis02-68	123	31	/	/	SYM
ajis02-68	123	32	province	province	NOUN
ajis02-68	123	33	/	/	SYM
ajis02-68	123	34	city	city	NOUN
ajis02-68	123	35	/	/	SYM
ajis02-68	123	36	name	name	NOUN
ajis02-68	123	37	mondial	mondial	NOUN
ajis02-68	123	38	4	4	NUM
ajis02-68	123	39	q4	q4	PROPN
ajis02-68	123	40	xmark	xmark	NOUN
ajis02-68	123	41	(	(	PUNCT
ajis02-68	123	42	100	100	NUM
ajis02-68	123	43	mb	mb	NOUN
ajis02-68	123	44	)	)	PUNCT
ajis02-68	123	45	4	4	NUM
ajis02-68	123	46	q5	q5	PROPN
ajis02-68	123	47	/person	/person	SYM
ajis02-68	123	48	/	/	SYM
ajis02-68	123	49	profile	profile	ADJ
ajis02-68	123	50	/	/	SYM
ajis02-68	123	51	interest	interest	NOUN
ajis02-68	123	52	/	/	SYM
ajis02-68	123	53	category	category	NOUN
ajis02-68	123	54	xmark	xmark	NOUN
ajis02-68	123	55	(	(	PUNCT
ajis02-68	123	56	1	1	NUM
ajis02-68	123	57	gb	gb	NOUN
ajis02-68	123	58	)	)	PUNCT
ajis02-68	123	59	4	4	NUM
ajis02-68	123	60	table	table	NOUN
ajis02-68	123	61	1	1	NUM
ajis02-68	123	62	.	.	PUNCT
ajis02-68	124	1	description	description	NOUN
ajis02-68	124	2	and	and	CCONJ
ajis02-68	124	3	parameters	parameter	NOUN
ajis02-68	124	4	of	of	ADP
ajis02-68	124	5	the	the	DET
ajis02-68	124	6	test	test	NOUN
ajis02-68	124	7	queries	query	NOUN
ajis02-68	124	8	analyse	analyse	VERB
ajis02-68	124	9	db	db	PROPN
ajis02-68	124	10	structure	structure	NOUN
ajis02-68	124	11	1	1	NUM
ajis02-68	124	12	create	create	VERB
ajis02-68	124	13	graph	graph	NOUN
ajis02-68	124	14	2	2	NUM
ajis02-68	124	15	apply	apply	NOUN
ajis02-68	124	16	numbering	number	VERB
ajis02-68	124	17	3	3	NUM
ajis02-68	124	18	select	select	ADJ
ajis02-68	124	19	component	component	NOUN
ajis02-68	124	20	path	path	NOUN
ajis02-68	124	21	1	1	NUM
ajis02-68	124	22	select	select	ADJ
ajis02-68	124	23	intermediate	intermediate	ADJ
ajis02-68	124	24	nodes	node	NOUN
ajis02-68	124	25	2	2	NUM
ajis02-68	124	26	present	present	ADJ
ajis02-68	124	27	as	as	ADP
ajis02-68	124	28	an	an	DET
ajis02-68	124	29	expandable	expandable	ADJ
ajis02-68	124	30	tree	tree	NOUN
ajis02-68	124	31	3	3	NUM
ajis02-68	124	32	storage	storage	NOUN
ajis02-68	124	33	stage	stage	NOUN
ajis02-68	124	34	query	query	NOUN
ajis02-68	124	35	stage	stage	NOUN
ajis02-68	124	36	1	1	NUM
ajis02-68	124	37	5	5	NUM
ajis02-68	124	38	2	2	NUM
ajis02-68	124	39	4	4	NUM
ajis02-68	124	40	3	3	NUM
ajis02-68	124	41	ajis	ajis	ADV
ajis02-68	124	42	vol	vol	NOUN
ajis02-68	124	43	13	13	NUM
ajis02-68	124	44	,	,	PUNCT
ajis02-68	124	45	no	no	INTJ
ajis02-68	124	46	.	.	NOUN
ajis02-68	124	47	1	1	NUM
ajis02-68	124	48	september	september	PROPN
ajis02-68	124	49	2005	2005	NUM
ajis02-68	124	50	157	157	NUM
ajis02-68	124	51	0.5	0.5	NUM
ajis02-68	124	52	1.0	1.0	NUM
ajis02-68	124	53	1.5	1.5	NUM
ajis02-68	124	54	2.0	2.0	NUM
ajis02-68	124	55	2.5	2.5	NUM
ajis02-68	124	56	3.0	3.0	NUM
ajis02-68	124	57	3.5	3.5	NUM
ajis02-68	124	58	4.0	4.0	NUM
ajis02-68	124	59	q1	q1	NOUN
ajis02-68	124	60	q2	q2	PROPN
ajis02-68	124	61	q3	q3	PROPN
ajis02-68	124	62	ti	ti	PROPN
ajis02-68	124	63	m	m	PROPN
ajis02-68	124	64	e	e	NOUN
ajis02-68	124	65	(	(	PUNCT
ajis02-68	124	66	s	s	NOUN
ajis02-68	124	67	)	)	PUNCT
ajis02-68	124	68	sequence	sequence	NOUN
ajis02-68	124	69	join	join	VERB
ajis02-68	124	70	multiple	multiple	ADJ
ajis02-68	124	71	pair	pair	NOUN
ajis02-68	124	72	-	-	PUNCT
ajis02-68	124	73	wise	wise	ADJ
ajis02-68	124	74	join	join	VERB
ajis02-68	124	75	20.0	20.0	NUM
ajis02-68	124	76	40.0	40.0	NUM
ajis02-68	124	77	60.0	60.0	NUM
ajis02-68	124	78	80.0	80.0	NUM
ajis02-68	124	79	100.0	100.0	NUM
ajis02-68	124	80	120.0	120.0	NUM
ajis02-68	124	81	q4	q4	PROPN
ajis02-68	124	82	q8	q8	PROPN
ajis02-68	124	83	ti	ti	PROPN
ajis02-68	124	84	m	m	PROPN
ajis02-68	124	85	e	e	X
ajis02-68	124	86	(	(	PUNCT
ajis02-68	124	87	s	s	NOUN
ajis02-68	124	88	)	)	PUNCT
ajis02-68	124	89	figure	figure	NOUN
ajis02-68	124	90	6	6	NUM
ajis02-68	124	91	.	.	PUNCT
ajis02-68	125	1	query	query	NOUN
ajis02-68	125	2	performance	performance	NOUN
ajis02-68	125	3	comparisons	comparison	NOUN
ajis02-68	125	4	the	the	DET
ajis02-68	125	5	cases	case	NOUN
ajis02-68	125	6	with	with	ADP
ajis02-68	125	7	the	the	DET
ajis02-68	125	8	query	query	NOUN
ajis02-68	125	9	path	path	NOUN
ajis02-68	125	10	length	length	NOUN
ajis02-68	125	11	of	of	ADP
ajis02-68	125	12	more	more	ADJ
ajis02-68	125	13	than	than	ADP
ajis02-68	125	14	2	2	NUM
ajis02-68	125	15	,	,	PUNCT
ajis02-68	125	16	demonstrates	demonstrate	VERB
ajis02-68	125	17	improved	improved	ADJ
ajis02-68	125	18	performance	performance	NOUN
ajis02-68	125	19	of	of	ADP
ajis02-68	125	20	the	the	DET
ajis02-68	125	21	sequence	sequence	NOUN
ajis02-68	125	22	algorithm	algorithm	NOUN
ajis02-68	125	23	against	against	ADP
ajis02-68	125	24	the	the	DET
ajis02-68	125	25	pair	pair	NOUN
ajis02-68	125	26	-	-	PUNCT
ajis02-68	125	27	wise	wise	ADJ
ajis02-68	125	28	algorithm	algorithm	NOUN
ajis02-68	125	29	(	(	PUNCT
ajis02-68	125	30	see	see	VERB
ajis02-68	125	31	figure	figure	NOUN
ajis02-68	125	32	6	6	NUM
ajis02-68	125	33	)	)	PUNCT
ajis02-68	125	34	.	.	PUNCT
ajis02-68	126	1	however	however	ADV
ajis02-68	126	2	,	,	PUNCT
ajis02-68	126	3	the	the	DET
ajis02-68	126	4	selection	selection	NOUN
ajis02-68	126	5	of	of	ADP
ajis02-68	126	6	the	the	DET
ajis02-68	126	7	result	result	NOUN
ajis02-68	126	8	of	of	ADP
ajis02-68	126	9	all	all	DET
ajis02-68	126	10	intermediate	intermediate	ADJ
ajis02-68	126	11	nodes	node	NOUN
ajis02-68	126	12	that	that	PRON
ajis02-68	126	13	constitute	constitute	VERB
ajis02-68	126	14	paths	path	NOUN
ajis02-68	126	15	between	between	ADP
ajis02-68	126	16	queries	query	NOUN
ajis02-68	126	17	nodes	node	NOUN
ajis02-68	126	18	are	be	AUX
ajis02-68	126	19	represented	represent	VERB
ajis02-68	126	20	as	as	ADP
ajis02-68	126	21	a	a	DET
ajis02-68	126	22	tree	tree	NOUN
ajis02-68	126	23	with	with	ADP
ajis02-68	126	24	expandable	expandable	ADJ
ajis02-68	126	25	nodes	node	NOUN
ajis02-68	126	26	.	.	PUNCT
ajis02-68	127	1	conclusion	conclusion	NOUN
ajis02-68	127	2	current	current	ADJ
ajis02-68	127	3	approaches	approach	NOUN
ajis02-68	127	4	adopted	adopt	VERB
ajis02-68	127	5	the	the	DET
ajis02-68	127	6	existing	exist	VERB
ajis02-68	127	7	relational	relational	ADJ
ajis02-68	127	8	storages	storage	NOUN
ajis02-68	127	9	(	(	PUNCT
ajis02-68	127	10	and	and	CCONJ
ajis02-68	127	11	map	map	VERB
ajis02-68	127	12	semi	semi	ADJ
ajis02-68	127	13	-	-	ADJ
ajis02-68	127	14	structured	structured	ADJ
ajis02-68	127	15	data	datum	NOUN
ajis02-68	127	16	into	into	ADP
ajis02-68	127	17	relational	relational	NOUN
ajis02-68	127	18	)	)	PUNCT
ajis02-68	127	19	or	or	CCONJ
ajis02-68	127	20	use	use	VERB
ajis02-68	127	21	native	native	ADJ
ajis02-68	127	22	solutions	solution	NOUN
ajis02-68	127	23	.	.	PUNCT
ajis02-68	128	1	there	there	PRON
ajis02-68	128	2	exist	exist	VERB
ajis02-68	128	3	hybrid	hybrid	ADJ
ajis02-68	128	4	solutions	solution	NOUN
ajis02-68	128	5	as	as	ADV
ajis02-68	128	6	well	well	ADV
ajis02-68	128	7	.	.	PUNCT
ajis02-68	129	1	since	since	SCONJ
ajis02-68	129	2	any	any	DET
ajis02-68	129	3	input	input	NOUN
ajis02-68	129	4	query	query	NOUN
ajis02-68	129	5	may	may	AUX
ajis02-68	129	6	initiate	initiate	VERB
ajis02-68	129	7	both	both	DET
ajis02-68	129	8	mining	mining	NOUN
ajis02-68	129	9	processes	process	NOUN
ajis02-68	129	10	and	and	CCONJ
ajis02-68	129	11	storage	storage	NOUN
ajis02-68	129	12	/	/	SYM
ajis02-68	129	13	retrieval	retrieval	NOUN
ajis02-68	129	14	operations	operation	NOUN
ajis02-68	129	15	,	,	PUNCT
ajis02-68	129	16	it	it	PRON
ajis02-68	129	17	is	be	AUX
ajis02-68	129	18	necessary	necessary	ADJ
ajis02-68	129	19	to	to	PART
ajis02-68	129	20	define	define	VERB
ajis02-68	129	21	appropriate	appropriate	ADJ
ajis02-68	129	22	criteria	criterion	NOUN
ajis02-68	129	23	and	and	CCONJ
ajis02-68	129	24	algorithms	algorithm	NOUN
ajis02-68	129	25	for	for	ADP
ajis02-68	129	26	splitting	splitting	NOUN
ajis02-68	129	27	/	/	SYM
ajis02-68	129	28	joining	join	VERB
ajis02-68	129	29	results	result	NOUN
ajis02-68	129	30	obtained	obtain	VERB
ajis02-68	129	31	on	on	ADP
ajis02-68	129	32	each	each	DET
ajis02-68	129	33	level	level	NOUN
ajis02-68	129	34	.	.	PUNCT
ajis02-68	130	1	we	we	PRON
ajis02-68	130	2	have	have	AUX
ajis02-68	130	3	developed	develop	VERB
ajis02-68	130	4	the	the	DET
ajis02-68	130	5	sequence	sequence	NOUN
ajis02-68	130	6	join	join	VERB
ajis02-68	130	7	algorithm	algorithm	NOUN
ajis02-68	130	8	for	for	ADP
ajis02-68	130	9	regular	regular	ADJ
ajis02-68	130	10	path	path	NOUN
ajis02-68	130	11	expressions	expression	NOUN
ajis02-68	130	12	.	.	PUNCT
ajis02-68	131	1	in	in	ADP
ajis02-68	131	2	contrast	contrast	NOUN
ajis02-68	131	3	to	to	PART
ajis02-68	131	4	pair	pair	VERB
ajis02-68	131	5	wise	wise	ADJ
ajis02-68	131	6	approach	approach	NOUN
ajis02-68	131	7	,	,	PUNCT
ajis02-68	131	8	the	the	DET
ajis02-68	131	9	algorithm	algorithm	NOUN
ajis02-68	131	10	takes	take	VERB
ajis02-68	131	11	several	several	ADJ
ajis02-68	131	12	lists	list	NOUN
ajis02-68	131	13	of	of	ADP
ajis02-68	131	14	elements	element	NOUN
ajis02-68	131	15	as	as	ADP
ajis02-68	131	16	an	an	DET
ajis02-68	131	17	input	input	NOUN
ajis02-68	131	18	and	and	CCONJ
ajis02-68	131	19	exploits	exploit	VERB
ajis02-68	131	20	the	the	DET
ajis02-68	131	21	position	position	NOUN
ajis02-68	131	22	of	of	ADP
ajis02-68	131	23	the	the	DET
ajis02-68	131	24	element	element	NOUN
ajis02-68	131	25	within	within	ADP
ajis02-68	131	26	xml	xml	NOUN
ajis02-68	131	27	document	document	NOUN
ajis02-68	131	28	to	to	PART
ajis02-68	131	29	compute	compute	VERB
ajis02-68	131	30	faster	fast	ADJ
ajis02-68	131	31	structural	structural	ADJ
ajis02-68	131	32	relationships	relationship	NOUN
ajis02-68	131	33	between	between	ADP
ajis02-68	131	34	elements	element	NOUN
ajis02-68	131	35	.	.	PUNCT
ajis02-68	132	1	the	the	DET
ajis02-68	132	2	processing	processing	NOUN
ajis02-68	132	3	of	of	ADP
ajis02-68	132	4	xml	xml	NOUN
ajis02-68	132	5	documents	document	NOUN
ajis02-68	132	6	may	may	AUX
ajis02-68	132	7	require	require	VERB
ajis02-68	132	8	a	a	DET
ajis02-68	132	9	traversal	traversal	NOUN
ajis02-68	132	10	of	of	ADP
ajis02-68	132	11	all	all	DET
ajis02-68	132	12	document	document	NOUN
ajis02-68	132	13	structure	structure	NOUN
ajis02-68	132	14	and	and	CCONJ
ajis02-68	132	15	,	,	PUNCT
ajis02-68	132	16	therefore	therefore	ADV
ajis02-68	132	17	,	,	PUNCT
ajis02-68	132	18	the	the	DET
ajis02-68	132	19	cost	cost	NOUN
ajis02-68	132	20	could	could	AUX
ajis02-68	132	21	be	be	AUX
ajis02-68	132	22	very	very	ADV
ajis02-68	132	23	high	high	ADJ
ajis02-68	132	24	.	.	PUNCT
ajis02-68	133	1	a	a	DET
ajis02-68	133	2	strong	strong	ADJ
ajis02-68	133	3	demand	demand	NOUN
ajis02-68	133	4	for	for	ADP
ajis02-68	133	5	a	a	DET
ajis02-68	133	6	means	means	NOUN
ajis02-68	133	7	of	of	ADP
ajis02-68	133	8	efficient	efficient	ADJ
ajis02-68	133	9	and	and	CCONJ
ajis02-68	133	10	effective	effective	ADJ
ajis02-68	133	11	xml	xml	NOUN
ajis02-68	133	12	processing	processing	NOUN
ajis02-68	133	13	has	have	AUX
ajis02-68	133	14	posed	pose	VERB
ajis02-68	133	15	a	a	DET
ajis02-68	133	16	new	new	ADJ
ajis02-68	133	17	challenge	challenge	NOUN
ajis02-68	133	18	for	for	ADP
ajis02-68	133	19	the	the	DET
ajis02-68	133	20	q5	q5	PROPN
ajis02-68	133	21	ajis	ajis	ADV
ajis02-68	133	22	vol	vol	VERB
ajis02-68	133	23	13	13	NUM
ajis02-68	133	24	,	,	PUNCT
ajis02-68	133	25	no	no	INTJ
ajis02-68	133	26	.	.	NOUN
ajis02-68	133	27	1	1	NUM
ajis02-68	133	28	september	september	PROPN
ajis02-68	133	29	2005	2005	NUM
ajis02-68	133	30	158	158	NUM
ajis02-68	133	31	database	database	NOUN
ajis02-68	133	32	world	world	NOUN
ajis02-68	133	33	(	(	PUNCT
ajis02-68	133	34	shoniregun	shoniregun	PROPN
ajis02-68	133	35	&	&	CCONJ
ajis02-68	133	36	logvynovskiy2004	logvynovskiy2004	PROPN
ajis02-68	133	37	)	)	PUNCT
ajis02-68	133	38	.	.	PUNCT
ajis02-68	134	1	therefore	therefore	ADV
ajis02-68	134	2	,	,	PUNCT
ajis02-68	134	3	the	the	DET
ajis02-68	134	4	structural	structural	ADJ
ajis02-68	134	5	pattern	pattern	NOUN
ajis02-68	134	6	are	be	AUX
ajis02-68	134	7	matched	match	VERB
ajis02-68	134	8	with	with	ADP
ajis02-68	134	9	available	available	ADJ
ajis02-68	134	10	input	input	NOUN
ajis02-68	134	11	lists	list	NOUN
ajis02-68	134	12	at	at	ADP
ajis02-68	134	13	once	once	ADV
ajis02-68	134	14	but	but	CCONJ
ajis02-68	134	15	does	do	AUX
ajis02-68	134	16	not	not	PART
ajis02-68	134	17	generate	generate	VERB
ajis02-68	134	18	non	non	ADJ
ajis02-68	134	19	-	-	ADJ
ajis02-68	134	20	existent	existent	ADJ
ajis02-68	134	21	sub	sub	NOUN
ajis02-68	134	22	-	-	NOUN
ajis02-68	134	23	results	result	NOUN
ajis02-68	134	24	and	and	CCONJ
ajis02-68	134	25	hence	hence	ADV
ajis02-68	134	26	eliminates	eliminate	VERB
ajis02-68	134	27	creation	creation	NOUN
ajis02-68	134	28	of	of	ADP
ajis02-68	134	29	excessive	excessive	ADJ
ajis02-68	134	30	intermediate	intermediate	ADJ
ajis02-68	134	31	data	datum	NOUN
ajis02-68	134	32	.	.	PUNCT
ajis02-68	135	1	references	reference	NOUN
ajis02-68	135	2	al	al	PROPN
ajis02-68	135	3	-	-	PUNCT
ajis02-68	135	4	khalifa	khalifa	PROPN
ajis02-68	135	5	,	,	PUNCT
ajis02-68	135	6	s.	s.	PROPN
ajis02-68	135	7	jagadish	jagadish	PROPN
ajis02-68	135	8	,	,	PUNCT
ajis02-68	135	9	h.v	h.v	PROPN
ajis02-68	135	10	.	.	PROPN
ajis02-68	135	11	koudas	koudas	PROPN
ajis02-68	135	12	,	,	PUNCT
ajis02-68	135	13	n.	n.	PROPN
ajis02-68	135	14	patel	patel	PROPN
ajis02-68	135	15	,	,	PUNCT
ajis02-68	135	16	j.m	j.m	PROPN
ajis02-68	135	17	.	.	PROPN
ajis02-68	135	18	srivastava	srivastava	PROPN
ajis02-68	135	19	,	,	PUNCT
ajis02-68	135	20	d.	d.	PROPN
ajis02-68	135	21	and	and	CCONJ
ajis02-68	135	22	wu	wu	PROPN
ajis02-68	135	23	,	,	PUNCT
ajis02-68	135	24	y.	y.	PROPN
ajis02-68	135	25	,(2002	,(2002	PROPN
ajis02-68	135	26	)	)	PUNCT
ajis02-68	135	27	“	"	PUNCT
ajis02-68	135	28	structural	structural	ADJ
ajis02-68	135	29	joins	join	VERB
ajis02-68	135	30	:	:	PUNCT
ajis02-68	135	31	a	a	DET
ajis02-68	135	32	primitive	primitive	ADJ
ajis02-68	135	33	for	for	ADP
ajis02-68	135	34	efficient	efficient	ADJ
ajis02-68	135	35	xml	xml	NOUN
ajis02-68	135	36	query	query	NOUN
ajis02-68	135	37	pattern	pattern	NOUN
ajis02-68	135	38	matching	matching	NOUN
ajis02-68	135	39	”	"	PUNCT
ajis02-68	135	40	,	,	PUNCT
ajis02-68	135	41	in	in	ADP
ajis02-68	135	42	proceedings	proceeding	NOUN
ajis02-68	135	43	of	of	ADP
ajis02-68	135	44	the	the	DET
ajis02-68	135	45	ieee	ieee	NOUN
ajis02-68	135	46	international	international	PROPN
ajis02-68	135	47	conference	conference	NOUN
ajis02-68	135	48	on	on	ADP
ajis02-68	135	49	database	database	NOUN
ajis02-68	135	50	engineering	engineering	NOUN
ajis02-68	135	51	(	(	PUNCT
ajis02-68	135	52	icde	icde	PROPN
ajis02-68	135	53	)	)	PUNCT
ajis02-68	135	54	.	.	PUNCT
ajis02-68	136	1	bray	bray	PROPN
ajis02-68	136	2	,	,	PUNCT
ajis02-68	136	3	t.	t.	PROPN
ajis02-68	136	4	,	,	PUNCT
ajis02-68	136	5	paoli	paoli	PROPN
ajis02-68	136	6	,	,	PUNCT
ajis02-68	136	7	j.	j.	PROPN
ajis02-68	136	8	sperberg	sperberg	PROPN
ajis02-68	136	9	-	-	PUNCT
ajis02-68	136	10	mcqueen	mcqueen	PROPN
ajis02-68	136	11	,	,	PUNCT
ajis02-68	136	12	c.m	c.m	PROPN
ajis02-68	136	13	.	.	PROPN
ajis02-68	136	14	,	,	PUNCT
ajis02-68	136	15	maler	maler	NOUN
ajis02-68	136	16	,	,	PUNCT
ajis02-68	136	17	e.	e.	PROPN
ajis02-68	136	18	,	,	PUNCT
ajis02-68	136	19	(	(	PUNCT
ajis02-68	136	20	2000	2000	NUM
ajis02-68	136	21	)	)	PUNCT
ajis02-68	136	22	“	"	PUNCT
ajis02-68	136	23	extensible	extensible	ADJ
ajis02-68	136	24	markup	markup	NOUN
ajis02-68	136	25	language	language	NOUN
ajis02-68	136	26	(	(	PUNCT
ajis02-68	136	27	xml	xml	NOUN
ajis02-68	136	28	)	)	PUNCT
ajis02-68	136	29	1.0	1.0	NUM
ajis02-68	136	30	(	(	PUNCT
ajis02-68	136	31	second	second	ADJ
ajis02-68	136	32	edition	edition	NOUN
ajis02-68	136	33	)	)	PUNCT
ajis02-68	136	34	”	"	PUNCT
ajis02-68	136	35	,	,	PUNCT
ajis02-68	136	36	w3c	w3c	PROPN
ajis02-68	136	37	recommendation	recommendation	NOUN
ajis02-68	136	38	.	.	PUNCT
ajis02-68	137	1	technical	technical	ADJ
ajis02-68	137	2	report	report	NOUN
ajis02-68	137	3	recxml-20001006	recxml-20001006	NOUN
ajis02-68	137	4	,	,	PUNCT
ajis02-68	137	5	available	available	ADJ
ajis02-68	137	6	from	from	ADP
ajis02-68	137	7	http://www.w3.org/tr/rec-xml	http://www.w3.org/tr/rec-xml	PROPN
ajis02-68	137	8	,	,	PUNCT
ajis02-68	137	9	(	(	PUNCT
ajis02-68	137	10	access	access	NOUN
ajis02-68	137	11	date	date	NOUN
ajis02-68	137	12	:	:	PUNCT
ajis02-68	137	13	29	29	NUM
ajis02-68	137	14	october	october	NOUN
ajis02-68	137	15	2004	2004	NUM
ajis02-68	137	16	)	)	PUNCT
ajis02-68	137	17	cooper	cooper	PROPN
ajis02-68	137	18	,	,	PUNCT
ajis02-68	137	19	b.	b.	PROPN
ajis02-68	137	20	sample	sample	PROPN
ajis02-68	137	21	,	,	PUNCT
ajis02-68	137	22	n.	n.	PROPN
ajis02-68	137	23	franklin	franklin	PROPN
ajis02-68	137	24	,	,	PUNCT
ajis02-68	137	25	m.	m.	NOUN
ajis02-68	137	26	hjaltason	hjaltason	PROPN
ajis02-68	137	27	,	,	PUNCT
ajis02-68	137	28	g.	g.	PROPN
ajis02-68	137	29	and	and	CCONJ
ajis02-68	137	30	shadmon	shadmon	PROPN
ajis02-68	137	31	,	,	PUNCT
ajis02-68	137	32	m.	m.	NOUN
ajis02-68	137	33	(	(	PUNCT
ajis02-68	137	34	2001	2001	NUM
ajis02-68	137	35	)	)	PUNCT
ajis02-68	137	36	“	"	PUNCT
ajis02-68	137	37	a	a	DET
ajis02-68	137	38	fast	fast	ADJ
ajis02-68	137	39	index	index	NOUN
ajis02-68	137	40	for	for	ADP
ajis02-68	137	41	semistructured	semistructure	VERB
ajis02-68	137	42	data	datum	NOUN
ajis02-68	137	43	”	"	PUNCT
ajis02-68	137	44	,	,	PUNCT
ajis02-68	137	45	in	in	ADP
ajis02-68	137	46	proceedings	proceeding	NOUN
ajis02-68	137	47	of	of	ADP
ajis02-68	137	48	vldb’01	vldb’01	PROPN
ajis02-68	137	49	.	.	PROPN
ajis02-68	137	50	deutsch	deutsch	PROPN
ajis02-68	137	51	,	,	PUNCT
ajis02-68	137	52	a.	a.	NOUN
ajis02-68	137	53	fernandez	fernandez	PROPN
ajis02-68	137	54	,	,	PUNCT
ajis02-68	137	55	m.	m.	NOUN
ajis02-68	137	56	and	and	CCONJ
ajis02-68	137	57	suciu	suciu	NOUN
ajis02-68	137	58	,	,	PUNCT
ajis02-68	137	59	d.	d.	PROPN
ajis02-68	137	60	(	(	PUNCT
ajis02-68	137	61	1999	1999	NUM
ajis02-68	137	62	)	)	PUNCT
ajis02-68	137	63	“	"	PUNCT
ajis02-68	137	64	storing	store	VERB
ajis02-68	137	65	semistructured	semistructure	VERB
ajis02-68	137	66	data	datum	NOUN
ajis02-68	137	67	with	with	ADP
ajis02-68	137	68	stored	store	VERB
ajis02-68	137	69	”	"	PUNCT
ajis02-68	137	70	,	,	PUNCT
ajis02-68	137	71	in	in	ADP
ajis02-68	137	72	proceedings	proceeding	NOUN
ajis02-68	137	73	of	of	ADP
ajis02-68	137	74	sigmod	sigmod	PROPN
ajis02-68	137	75	conference	conference	NOUN
ajis02-68	137	76	papakonstantinou	papakonstantinou	NOUN
ajis02-68	137	77	,	,	PUNCT
ajis02-68	137	78	y.	y.	PROPN
ajis02-68	137	79	garcia	garcia	PROPN
ajis02-68	137	80	-	-	PUNCT
ajis02-68	137	81	molina	molina	PROPN
ajis02-68	137	82	,	,	PUNCT
ajis02-68	137	83	h.	h.	PROPN
ajis02-68	137	84	and	and	CCONJ
ajis02-68	137	85	widom	widom	PROPN
ajis02-68	137	86	,	,	PUNCT
ajis02-68	137	87	j.	j.	PROPN
ajis02-68	137	88	(	(	PUNCT
ajis02-68	137	89	1995	1995	NUM
ajis02-68	137	90	)	)	PUNCT
ajis02-68	137	91	“	"	PUNCT
ajis02-68	137	92	object	object	VERB
ajis02-68	137	93	exchange	exchange	NOUN
ajis02-68	137	94	across	across	ADP
ajis02-68	137	95	heterogeneous	heterogeneous	ADJ
ajis02-68	137	96	information	information	NOUN
ajis02-68	137	97	sources	source	NOUN
ajis02-68	137	98	”	"	PUNCT
ajis02-68	137	99	,	,	PUNCT
ajis02-68	137	100	in	in	ADP
ajis02-68	137	101	proceedings	proceeding	NOUN
ajis02-68	137	102	of	of	ADP
ajis02-68	137	103	the	the	DET
ajis02-68	137	104	11th	11th	ADJ
ajis02-68	137	105	international	international	ADJ
ajis02-68	137	106	conference	conference	NOUN
ajis02-68	137	107	on	on	ADP
ajis02-68	137	108	data	datum	NOUN
ajis02-68	137	109	engineering	engineering	NOUN
ajis02-68	137	110	.	.	PUNCT
ajis02-68	138	1	shoniregun	shoniregun	PROPN
ajis02-68	138	2	,	,	PUNCT
ajis02-68	138	3	c.	c.	PROPN
ajis02-68	138	4	a.	a.	PROPN
ajis02-68	138	5	and	and	CCONJ
ajis02-68	138	6	logvynovskiy	logvynovskiy	PROPN
ajis02-68	138	7	,	,	PUNCT
ajis02-68	138	8	o.	o.	PROPN
ajis02-68	138	9	(	(	PUNCT
ajis02-68	138	10	2004	2004	NUM
ajis02-68	138	11	)	)	PUNCT
ajis02-68	138	12	“	"	PUNCT
ajis02-68	138	13	securing	secure	VERB
ajis02-68	138	14	xml	xml	NOUN
ajis02-68	138	15	documents	document	NOUN
ajis02-68	138	16	”	"	PUNCT
ajis02-68	138	17	,	,	PUNCT
ajis02-68	138	18	the	the	DET
ajis02-68	138	19	australian	australian	ADJ
ajis02-68	138	20	journal	journal	NOUN
ajis02-68	138	21	of	of	ADP
ajis02-68	138	22	information	information	NOUN
ajis02-68	138	23	systems	system	NOUN
ajis02-68	138	24	(	(	PUNCT
ajis02-68	138	25	ajis	ajis	ADV
ajis02-68	138	26	)	)	PUNCT
ajis02-68	138	27	,	,	PUNCT
ajis02-68	138	28	september	september	PROPN
ajis02-68	138	29	,	,	PUNCT
ajis02-68	138	30	vol	vol	NOUN
ajis02-68	138	31	11	11	NUM
ajis02-68	138	32	,	,	PUNCT
ajis02-68	138	33	pp	pp	ADV
ajis02-68	138	34	194	194	NUM
ajis02-68	138	35	-	-	SYM
ajis02-68	138	36	200	200	NUM
ajis02-68	138	37	.	.	PUNCT
ajis02-68	139	1	wang	wang	PROPN
ajis02-68	139	2	,	,	PUNCT
ajis02-68	139	3	k.	k.	PROPN
ajis02-68	139	4	,	,	PUNCT
ajis02-68	139	5	liu	liu	PROPN
ajis02-68	139	6	,	,	PUNCT
ajis02-68	139	7	h.q	h.q	PROPN
ajis02-68	139	8	.	.	PROPN
ajis02-68	139	9	(	(	PUNCT
ajis02-68	139	10	2001	2001	NUM
ajis02-68	139	11	)	)	PUNCT
ajis02-68	139	12	“	"	PUNCT
ajis02-68	139	13	mining	mining	NOUN
ajis02-68	139	14	is	be	AUX
ajis02-68	139	15	part	part	NOUN
ajis02-68	139	16	of	of	ADP
ajis02-68	139	17	association	association	NOUN
ajis02-68	139	18	patterns	pattern	NOUN
ajis02-68	139	19	from	from	ADP
ajis02-68	139	20	semistructured	semistructure	VERB
ajis02-68	139	21	data	datum	NOUN
ajis02-68	139	22	”	"	PUNCT
ajis02-68	139	23	,	,	PUNCT
ajis02-68	139	24	in	in	ADP
ajis02-68	139	25	proceedings	proceeding	NOUN
ajis02-68	139	26	of	of	ADP
ajis02-68	139	27	the	the	DET
ajis02-68	139	28	9th	9th	ADJ
ajis02-68	139	29	ifip	ifip	NOUN
ajis02-68	139	30	2.6	2.6	NUM
ajis02-68	139	31	working	work	VERB
ajis02-68	139	32	conference	conference	NOUN
ajis02-68	139	33	on	on	ADP
ajis02-68	139	34	database	database	NOUN
ajis02-68	139	35	semantics	semantic	NOUN
ajis02-68	139	36	(	(	PUNCT
ajis02-68	139	37	ds-9	ds-9	NUM
ajis02-68	139	38	)	)	PUNCT
ajis02-68	139	39	,	,	PUNCT
ajis02-68	139	40	hong	hong	PROPN
ajis02-68	139	41	kong	kong	PROPN
ajis02-68	139	42	,	,	PUNCT
ajis02-68	139	43	april	april	PROPN
ajis02-68	139	44	.	.	PUNCT
ajis02-68	140	1	xyleme	xyleme	PROPN
ajis02-68	140	2	,	,	PUNCT
ajis02-68	140	3	l.	l.	PROPN
ajis02-68	140	4	(	(	PUNCT
ajis02-68	140	5	2001	2001	NUM
ajis02-68	140	6	)	)	PUNCT
ajis02-68	140	7	“	"	PUNCT
ajis02-68	140	8	a	a	DET
ajis02-68	140	9	dynamic	dynamic	ADJ
ajis02-68	140	10	warehouse	warehouse	NOUN
ajis02-68	140	11	for	for	ADP
ajis02-68	140	12	xml	xml	NOUN
ajis02-68	140	13	data	datum	NOUN
ajis02-68	140	14	of	of	ADP
ajis02-68	140	15	the	the	DET
ajis02-68	140	16	web	web	NOUN
ajis02-68	140	17	”	"	PUNCT
ajis02-68	140	18	,	,	PUNCT
ajis02-68	140	19	in	in	ADP
ajis02-68	140	20	bulletin	bulletin	NOUN
ajis02-68	140	21	of	of	ADP
ajis02-68	140	22	the	the	DET
ajis02-68	140	23	technical	technical	PROPN
ajis02-68	140	24	committee	committee	PROPN
ajis02-68	140	25	on	on	ADP
ajis02-68	140	26	data	datum	NOUN
ajis02-68	140	27	engineering	engineering	NOUN
ajis02-68	140	28	,	,	PUNCT
ajis02-68	140	29	vol	vol	NOUN
ajis02-68	140	30	.	.	PROPN
ajis02-68	140	31	24	24	NUM
ajis02-68	140	32	,	,	PUNCT
ajis02-68	140	33	no	no	INTJ
ajis02-68	140	34	.	.	NOUN
ajis02-68	140	35	2	2	NUM
ajis02-68	140	36	,	,	PUNCT
ajis02-68	140	37	june	june	PROPN
ajis02-68	140	38	.	.	PUNCT
ajis02-68	140	39	.	.	PUNCT