Sciweavers

486 search results - page 5 / 98
» Evaluating Top-k Queries over Web-Accessible Databases
Sort
View
VLDB
2012
ACM
361views Database» more  VLDB 2012»
13 years 5 months ago
Answering pattern match queries in large graph databases via graph embedding
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability verification, and pattern ...
Lei Zou, Lei Chen 0002, M. Tamer Özsu, Dongya...
SSDBM
2008
IEEE
149views Database» more  SSDBM 2008»
15 years 3 months ago
Query Planning for Searching Inter-dependent Deep-Web Databases
Increasingly, many data sources appear as online databases, hidden behind query forms, thus forming what is referred to as the deep web. It is desirable to have systems that can pr...
Fan Wang, Gagan Agrawal, Ruoming Jin
61
Voted
TODS
2002
66views more  TODS 2002»
14 years 9 months ago
Top-k selection queries over relational databases: Mapping strategies and performance evaluation
Nicolas Bruno, Surajit Chaudhuri, Luis Gravano
PODS
2008
ACM
123views Database» more  PODS 2008»
15 years 9 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
PVLDB
2008
104views more  PVLDB 2008»
14 years 9 months ago
Scalable multi-query optimization for exploratory queries over federated scientific databases
The diversity and large volumes of data processed in the Natural Sciences today has led to a proliferation of highlyspecialized and autonomous scientific databases with inherent a...
Anastasios Kementsietsidis, Frank Neven, Dieter Va...