Sciweavers

486 search results - page 2 / 98
» Evaluating Top-k Queries over Web-Accessible Databases
Sort
View
ICDE
2005
IEEE
240views Database» more  ICDE 2005»
14 years 6 months ago
Adaptive Processing of Top-K Queries in XML
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
Amélie Marian, Divesh Srivastava, Nick Koud...
PVLDB
2010
140views more  PVLDB 2010»
13 years 3 months ago
Optimal Top-K Query Evaluation for Weighted Business Processes
A Business Process (BP for short) consists of a set of activities that achieve some business goal when combined in a flow. Among all the (maybe infinitely many) possible executi...
Daniel Deutch, Tova Milo, Neoklis Polyzotis, Tom Y...
ICDE
2010
IEEE
428views Database» more  ICDE 2010»
14 years 4 months ago
Supporting Top-K Keyword Search in XML Databases
Keyword search is considered to be an effective information discovery method for both structured and semistructured data. In XML keyword search, query semantics is based on the con...
Liang Jeff Chen, Yannis Papakonstantinou
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
14 years 6 months ago
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
Lei Zou, Lei Chen 0002
ICDE
2002
IEEE
217views Database» more  ICDE 2002»
14 years 6 months ago
Evaluating Top-k Queries over Web-Accessible Databases
Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires pr...
Nicolas Bruno, Luis Gravano, Amélie Marian