Sciweavers

613 search results - page 77 / 123
» Query Evaluation on a Database Given by a Random Graph
Sort
View
119
Voted
SIGMOD
1998
ACM
97views Database» more  SIGMOD 1998»
15 years 7 months ago
Cost Based Query Scrambling for Initial Delays
Remote data access from disparate sources across a widearea network such as the Internet is problematic due to the unpredictable nature of the communications medium and the lack o...
Tolga Urhan, Michael J. Franklin, Laurent Amsaleg
167
Voted
BMCBI
2006
195views more  BMCBI 2006»
15 years 3 months ago
Hubs of knowledge: using the functional link structure in Biozon to mine for biologically significant entities
Background: Existing biological databases support a variety of queries such as keyword or definition search. However, they do not provide any measure of relevance for the instance...
Paul Shafer, Timothy Isganitis, Golan Yona
113
Voted
ICDE
2010
IEEE
201views Database» more  ICDE 2010»
15 years 3 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
123
Voted
ER
2007
Springer
111views Database» more  ER 2007»
15 years 9 months ago
Provability-Based Semantic Interoperability Via Translation Graphs
Provability-based semantic interoperability (PBSI) is a kind of interoperability that transcends mere syntactic translation to allow for robust, meaningful information exchange acr...
Joshua Taylor, Andrew Shilliday, Selmer Bringsjord
130
Voted
CIVR
2007
Springer
180views Image Analysis» more  CIVR 2007»
15 years 9 months ago
Probabilistic matching and resemblance evaluation of shapes in trademark images
We present a novel matching and similarity evaluation method for planar geometric shapes represented by sets of polygonal curves. Given two shapes, the matching algorithm randomly...
Helmut Alt, Ludmila Scharf, Sven Scholz