294 search results - page 32 / 59 » Efficiently Processing Queries on Interval-and-Value Tuples ... |
255
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...
158
click to vote
ICDE
2010
IEEE
16 years 5 months ago
2010
IEEE
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
157
click to vote
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
Sybase's flagship database product, Adaptive Server Enterprise provides Native XML processing (NXS) support. In this paper we present our experience related to query processi...
193
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
170
click to vote
PVLDB
2010
15 years 4 months ago
2010
Keyword search in relational databases has been extensively studied. Given a relational database, a keyword query finds a set of interconnected tuple structures connected by fore...