92 search results - page 4 / 19 » Conjunctive Query Evaluation by Search Tree Revisited |
COMPGEOM
2010
ACM
14 years 14 days ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
ICDT
2012
ACM
11 years 9 months ago
2012
ACM
We introduce a representation system for relational data based on algebraic factorisation using distributivity of product over union and commutativity of product and union. We giv...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
EDBT
2004
ACM
14 years 7 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
SEMWEB
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. In order to effectively and quickly answer queries in environments with distributed RDF/OWL, we present a query optimization algorithm to identify the potentially relevan...