Sciweavers

613 search results - page 61 / 123
» Query Evaluation on a Database Given by a Random Graph
Sort
View
133
Voted
EMNLP
2010
15 years 1 months ago
Automatic Keyphrase Extraction via Topic Decomposition
Existing graph-based ranking methods for keyphrase extraction compute a single importance score for each word via a single random walk. Motivated by the fact that both documents a...
Zhiyuan Liu, Wenyi Huang, Yabin Zheng, Maosong Sun
214
Voted
ICDE
2006
IEEE
198views Database» more  ICDE 2006»
16 years 5 months ago
Automating the Design and Construction of Query Forms
One of the simplest ways to query a database is through a form, where a user can fill in relevant information and obtain desired results by submitting the form. Designing good sta...
Magesh Jayapandian, H. V. Jagadish
136
Voted
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
15 years 9 months ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner
113
Voted
ERSHOV
2006
Springer
15 years 7 months ago
Chase of Recursive Queries
In this work, we present a semantic query optimization technique to improve the efficiency of the evaluation of a subset of SQL:1999 recursive queries. Using datalog notation, we c...
Nieves R. Brisaboa, Antonio Fariña, Miguel ...
131
Voted
SIGMOD
2004
ACM
150views Database» more  SIGMOD 2004»
16 years 3 months ago
When one Sample is not Enough: Improving Text Database Selection Using Shrinkage
Database selection is an important step when searching over large numbers of distributed text databases. The database selection task relies on statistical summaries of the databas...
Panagiotis G. Ipeirotis, Luis Gravano