552 search results - page 13 / 111 » Efficient Algorithms for Processing XPath Queries |
IJSWIS
2008
14 years 9 months ago
2008
Relational technology has shown to be very useful for scalable Semantic Web data management. Numerous researchers have proposed to use RDBMSs to store and query voluminous RDF dat...
166
click to vote
ICDE
2008
IEEE
15 years 10 months ago
2008
IEEE
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
CIKM
2009
Springer
15 years 1 months ago
2009
Springer
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
75
Voted
FUIN
2006
14 years 9 months ago
2006
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 algorithm due to M...
165
click to vote
SIGMOD
2007
ACM
15 years 9 months ago
2007
ACM
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...