2859 search results - page 188 / 572 » Querying Complex Structured Databases |
PODS
2008
ACM
16 years 2 months ago
2008
ACM
Conjunctive query (CQ) evaluation on relational databases is NP-complete in general. Several restrictions, like bounded tree-width and bounded hypertree-width, allow polynomial ti...
208
click to vote
ICDE
2005
IEEE
16 years 3 months ago
2005
IEEE
Index structures are designed to optimize search performance, while at the same time supporting efficient data updates. Although not explicit, existing index structures are typica...
147
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
126
click to vote
JAR
2006
15 years 2 months ago
2006
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
120
click to vote
WEBDB
2001
Springer
15 years 6 months ago
2001
Springer
Indexing schemes for semistructured data have been developed in recent years to optimize path query processing by summarizing path information. However, most of these schemes can ...