Sciweavers

589 search results - page 100 / 118
» Optimized Query Evaluation Using Cooperative Sorts
Sort
View
ICDE
2010
IEEE
201views Database» more  ICDE 2010»
13 years 7 months ago
Vertical partitioning of relational OLTP databases using integer programming
A way to optimize performance of relational row store databases is to reduce the row widths by vertically partitioning tables into table fractions in order to minimize the number ...
Rasmus Resen Amossen
ICDAR
2011
IEEE
12 years 7 months ago
Writer Retrieval - Exploration of a Novel Biometric Scenario Using Perceptual Features Derived from Script Orientation
—We propose a novel scenario called “writer retrieval” consisting in the retrieval from a set of documents all those produced by the same writer. The retrieval is based on a ...
Vlad Atanasiu, Laurence Likforman-Sulem, Nicole Vi...
ICDE
2006
IEEE
135views Database» more  ICDE 2006»
14 years 8 months ago
Reverse Nearest Neighbors Search in Ad-hoc Subspaces
Given an object q, modeled by a multidimensional point, a reverse nearest neighbors (RNN) query returns the set of objects in the database that have q as their nearest neighbor. I...
Man Lung Yiu, Nikos Mamoulis
SIGMOD
2005
ACM
126views Database» more  SIGMOD 2005»
14 years 7 months ago
Cost-Sensitive Reordering of Navigational Primitives
We present a method to evaluate path queries based on the novel concept of partial path instances. Our method (1) maximizes performance by means of sequential scans or asynchronou...
Carl-Christian Kanne, Matthias Brantner, Guido Moe...
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
13 years 5 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen