Sciweavers

516 search results - page 18 / 104
» Retroactive answering of search queries
Sort
View
112
Voted
WEBDB
2005
Springer
129views Database» more  WEBDB 2005»
15 years 6 months ago
Processing Top-N Queries in P2P-based Web Integration Systems with Probabilistic Guarantees
Efficient query processing in P2P-based Web integration systems poses a variety of challenges resulting from the strict decentralization and limited knowledge. As a special probl...
Katja Hose, Marcel Karnstedt, Kai-Uwe Sattler, Dan...
219
Voted
ICDE
2009
IEEE
205views Database» more  ICDE 2009»
16 years 2 months ago
Top-k Exploration of Query Candidates for Efficient Keyword Search on Graph-Shaped (RDF) Data
Keyword queries enjoy widespread usage as they represent an intuitive way of specifying information needs. Recently, answering keyword queries on graph-structured data has emerged ...
Thanh Tran, Haofen Wang, Sebastian Rudolph, Philip...
SUTC
2006
IEEE
15 years 6 months ago
Transitive Nearest Neighbor Search in Mobile Environments
Given a query point p, typically the position of a current client, and two datasets S and R, a transitive nearest neighbor (TNN) search returns a pair of objects (s, r) ∈ S × R...
Baihua Zheng, Ken C. K. Lee, Wang-Chien Lee
179
Voted
SIGMOD
2007
ACM
232views Database» more  SIGMOD 2007»
16 years 25 days ago
BLINKS: ranked keyword searches on graphs
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
Haixun Wang, Hao He, Jun Yang 0001, Philip S. Yu
127
Voted
COMAD
2009
15 years 1 months ago
Information Integration: Challenges and Approaches
The problem of information integration is discussed in the context of answering a query over the web. Querying the web requires that information from different web and other sourc...
Sharma Chakravarthy