Sciweavers

649 search results - page 97 / 130
» Improved and Optimized Partitioning Techniques in Database Q...
Sort
View
142
Voted
SSDBM
2006
IEEE
197views Database» more  SSDBM 2006»
15 years 9 months ago
InterJoin: Exploiting Indexes and Materialized Views in XPath Evaluation
XML has become the standard for data exchange for a wide variety of applications, particularly in the scientific community. In order to efficiently process queries on XML repres...
Derek Phillips, Ning Zhang 0002, Ihab F. Ilyas, M....
156
Voted
CRIWG
2004
15 years 5 months ago
Ariane: An Awareness Mechanism for Shared Databases
Awareness is an essential requirement in collaborative activities. This paper presents Ariane, a generic and reusable awareness infrastructure, independent of a specific applicatio...
Vaninha Vieira, Marco A. S. Mangan, Cláudia...
136
Voted
DKE
2006
123views more  DKE 2006»
15 years 3 months ago
Cost models for distance joins queries using R-trees
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
134
Voted
BMCBI
2008
135views more  BMCBI 2008»
15 years 3 months ago
Ab-origin: an enhanced tool to identify the sourcing gene segments in germline for rearranged antibodies
Background: In the adaptive immune system, variable regions of immunoglobulin (IG) are encoded by random recombination of variable (V), diversity (D), and joining (J) gene segment...
Xiaojing Wang, Di Wu, SiYuan Zheng, Jing Sun, Lin ...
145
Voted
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
16 years 29 days ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu