Sciweavers

613 search results - page 48 / 123
» Query Evaluation on a Database Given by a Random Graph
Sort
View
120
Voted
AAAI
2010
15 years 5 months ago
Diversifying Query Suggestion Results
In order to improve the user search experience, Query Suggestion, a technique for generating alternative queries to Web users, has become an indispensable feature for commercial s...
Hao Ma, Michael R. Lyu, Irwin King
153
Voted
PRIS
2004
15 years 5 months ago
Similarity Range Queries in Streaming Time Series
Similarity search in time series databases is an important research direction. Several methods have been proposed in order to provide algorithms for efficient query processing in t...
Maria Kontaki, Apostolos Papadopoulos, Yannis Mano...
133
Voted
DBPL
2007
Springer
103views Database» more  DBPL 2007»
15 years 7 months ago
Datalog Programs over Infinite Databases, Revisited
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
Sara Cohen, Joseph Gil, Evelina Zarivach
139
Voted
ICSNW
2004
Springer
188views Database» more  ICSNW 2004»
15 years 9 months ago
Peer Selection in Peer-to-Peer Networks with Semantic Topologies
Peer-to-Peer systems have proven to be an effective way of sharing data. Modern protocols are able to efficiently route a message to a given peer. However, determining the destin...
Peter Haase, Ronny Siebes, Frank van Harmelen
128
Voted
ICDM
2008
IEEE
168views Data Mining» more  ICDM 2008»
15 years 10 months ago
Measuring Proximity on Graphs with Side Information
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
Hanghang Tong, Huiming Qu, Hani Jamjoom