Sciweavers

4302 search results - page 399 / 861
» Index Pairs Algorithms
Sort
View
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
15 years 11 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
CIKM
2001
Springer
15 years 10 months ago
Real Time User Context Modeling for Information Retrieval Agents
The success of personal information agents depends on their ability to provide task-relevant information. This paper presents WordSieve, a new algorithm that generates context des...
Travis Bauer, David B. Leake
182
Voted
EDBT
1998
ACM
131views Database» more  EDBT 1998»
15 years 10 months ago
Processing Complex Similarity Queries with Distance-Based Access Methods
Efficient evaluation of similarity queries is one of the basic requirements for advanced multimedia applications. In this paper, we consider the relevant case where complex similar...
Paolo Ciaccia, Marco Patella, Pavel Zezula
BTW
2007
Springer
153views Database» more  BTW 2007»
15 years 10 months ago
Efficient Time-Travel on Versioned Text Collections
: The availability of versioned text collections such as the Internet Archive opens up opportunities for time-aware exploration of their contents. In this paper, we propose time-tr...
Klaus Berberich, Srikanta J. Bedathur, Gerhard Wei...
CIKM
2009
Springer
15 years 10 months ago
Efficient processing of group-oriented connection queries in a large graph
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...
James Cheng, Yiping Ke, Wilfred Ng