92 search results - page 4 / 19 » Conjunctive Query Evaluation by Search Tree Revisited |
101
Voted
COMPGEOM
2010
ACM
15 years 5 months 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...
122
Voted
ICDT
2012
ACM
13 years 2 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...
119
Voted
ICDE
2010
IEEE
16 years 6 days 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...
109
Voted
EDBT
2004
ACM
16 years 17 days 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...
107
Voted
SEMWEB
2010
Springer
14 years 10 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...