Sciweavers

4 search results - page 1 / 1
» URank: formulation and efficient evaluation of top-k queries...
Sort
View
SIGMOD
2007
ACM
176views Database» more  SIGMOD 2007»
14 years 11 months ago
URank: formulation and efficient evaluation of top-k queries in uncertain databases
Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between query scores and data uncertainty ma...
Mohamed A. Soliman, Ihab F. Ilyas, Kevin Chen-Chua...
ICDE
2003
IEEE
170views Database» more  ICDE 2003»
15 years 12 days ago
Keyword Proximity Search on XML Graphs
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
Vagelis Hristidis, Yannis Papakonstantinou, Andrey...
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
15 years 23 days ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
EDBT
2009
ACM
208views Database» more  EDBT 2009»
14 years 5 months ago
Flexible and efficient querying and ranking on hyperlinked data sources
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
Ramakrishna Varadarajan, Vagelis Hristidis, Louiqa...