329 search results - page 3 / 66 » Efficient Parallel Query Processing by Graph Ranking |
IS
2007
13 years 7 months ago
2007
Despite the importance of ranked queries in numerous applications involving multi-criteria decision making, they are not efficiently supported by traditional database systems. In ...
VLDB
2007
ACM
14 years 1 months ago
2007
ACM
In many applications, the underlying data (the web, an XML document, or a relational database) can be seen as a graph. These graphs may be enriched with weights, associated with t...
BTW
2007
Springer
2007
Springer
TopX - Efficient and Versatile Top-k Query Process-ing for Text, Semistructured, and Structured Data
13 years 11 months ago
: This paper presents a comprehensive overview of the TopX search engine, an extensive framework for unified indexing and querying large collections of unstructured, semistructured...
EDBT
2009
ACM
14 years 2 months ago
2009
ACM
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
CIKM
2009
Springer
13 years 11 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...