Sciweavers

739 search results - page 85 / 148
» Sorting Algorithms
Sort
View
RECOMB
2007
Springer
14 years 8 months ago
How to Achieve an Equivalent Simple Permutation in Linear Time
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Simon Gog, Martin Bader
ICDE
2002
IEEE
130views Database» more  ICDE 2002»
14 years 9 months ago
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relations...
Shurug Al-Khalifa, H. V. Jagadish, Jignesh M. Pate...
VLDB
2002
ACM
143views Database» more  VLDB 2002»
13 years 7 months ago
SQL Memory Management in Oracle9i
Complex database queries require the use of memory-intensive operators like sort and hashjoin. Those operators need memory, also referred to as SQL memory, to process their input ...
Benoît Dageville, Mohamed Zaït
PAAPP
2007
109views more  PAAPP 2007»
13 years 7 months ago
Relation rule mining
\Web users are nowadays confronted with the huge variety of available information sources whose content is not targeted at any specific group or layer. Recommendation systems aim...
Mehdi Adda, Rokia Missaoui, Petko Valtchev
SBBD
2004
82views Database» more  SBBD 2004»
13 years 9 months ago
Optimizing Ranking Calculation in Web Search Engines: a Case Study
Web search engines compete to offer the fastest responses with highest relevance. However, as Web collections grow, it becomes more difficult to achieve this purpose. As most user...
Miguel Costa, Mário J. Silva