Sciweavers

5122 search results - page 121 / 1025
» Comparing Consequence Relations
Sort
View
144
Voted
WWW
2009
ACM
15 years 9 months ago
Building term suggestion relational graphs from collective intelligence
This paper proposes an effective approach to provide relevant search terms for conceptual Web search. ‘Semantic Term Suggestion’ function has been included so that users can f...
Jyh-Ren Shieh, Yung-Huan Hsieh, Yang-Ting Yeh, Tse...
ICDE
2008
IEEE
182views Database» more  ICDE 2008»
15 years 9 months ago
Two-phase schema matching in real world relational databases
— We propose a new approach to the problem of schema matching in relational databases that merges the hybrid and composite approach of combining multiple individual matching tech...
Nikolaos Bozovic, Vasilis Vassalos
126
Voted
BTW
2005
Springer
108views Database» more  BTW 2005»
15 years 8 months ago
Integrating the Relational Interval Tree into IBM's DB2 Universal Database Server
: User-defined data types such as intervals require specialized access methods to be efficiently searched and queried. As database implementors cannot provide appropriate index str...
Christoph Brochhaus, Jost Enderle, Achim Schlosser...
116
Voted
EMSOFT
2008
Springer
15 years 4 months ago
Automatically transforming and relating Uppaal models of embedded systems
Relations between models are important for effective automatic validation, for comparing implementations with specifications, and for increased understanding of embedded systems d...
Timothy Bourke, Arcot Sowmya
103
Voted
ICDE
2010
IEEE
201views Database» more  ICDE 2010»
15 years 2 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