1388 search results - page 140 / 278 » Querying Linguistic Trees |
191
click to vote
VLDB
2007
ACM
16 years 29 days ago
2007
ACM
The performance of XML database queries can be greatly enhanced by rewriting them using materialized views. We study the problem of rewriting a query using materialized views, whe...
119
Voted
ADC
2008
Springer
15 years 7 months ago
2008
Springer
As the eXtensible Markup Language (XML) is about to emerge as a new standard for databases, the problem of providing solid logical grounds for XML query languages arises. For the ...
116
Voted
PPAM
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
133
Voted
PLANX
2007
15 years 2 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
136
Voted
SIGMOD
2010
ACM
14 years 7 months ago
2010
ACM
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...