Sciweavers

165 search results - page 29 / 33
» icds 2010
Sort
View
ICDE
2010
IEEE
568views Database» more  ICDE 2010»
14 years 9 months ago
Reverse Top-k Queries
Rank-aware query processing has become essential for many applications that return to the user only the top-k objects based on the individual user's preferences. Top-k queries...
Akrivi Vlachou, Christos Doulkeridis, Kjetil N&osl...
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
14 years 9 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 9 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
ICDE
2010
IEEE
263views Database» more  ICDE 2010»
14 years 9 months ago
Managing Uncertainty of XML Schema Matching
Abstract-- Despite of advances in machine learning technologies, a schema matching result between two database schemas (e.g., those derived from COMA++) is likely to be imprecise. ...
Reynold Cheng, Jian Gong, David W. Cheung
ICDE
2010
IEEE
248views Database» more  ICDE 2010»
14 years 9 months ago
FPGA Acceleration for the Frequent Item Problem
Abstract-- Field-programmable gate arrays (FPGAs) can provide performance advantages with a lower resource consumption (e.g., energy) than conventional CPUs. In this paper, we show...
Gustavo Alonso, Jens Teubner, René Mül...