Sciweavers

261 search results - page 2 / 53
» An Optimization Technique for Answering Regular Path Queries
Sort
View
SEMWEB
2010
Springer
13 years 2 months ago
Combining Approximation and Relaxation in Semantic Web Path Queries
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
Alexandra Poulovassilis, Peter T. Wood
ICDT
2001
ACM
162views Database» more  ICDT 2001»
13 years 9 months ago
Algebraic Rewritings for Optimizing Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in query optimization, data integration, data warehousing etc. Query rewriting in relational databases ...
Gösta Grahne, Alex Thomo
ISPA
2007
Springer
13 years 10 months ago
Distributed Multi-source Regular Path Queries
Regular path queries are the building block of almost any mechanism for querying semistructured data. Despite the fact that the main applications of such data are distributed, ther...
Maryam Shoaran, Alex Thomo
ICDT
2007
ACM
117views Database» more  ICDT 2007»
13 years 10 months ago
Preferentially Annotated Regular Path Queries
In this paper, we introduce preferential regular path queries. These are regular path queries whose symbols are annotated with preference weights for “scaling” up or down the i...
Gösta Grahne, Alex Thomo, William W. Wadge
FUIN
2008
88views more  FUIN 2008»
13 years 4 months ago
Preferential Regular Path Queries
In this paper, we introduce preferential regular path queries. These are regular path queries whose symbols are annotated with preference weights for "scaling" up or down...
Gösta Grahne, Alex Thomo, William W. Wadge