Sciweavers

1381 search results - page 271 / 277
» Structural signatures for tree data structures
Sort
View
ALMOB
2006
89views more  ALMOB 2006»
13 years 7 months ago
On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
Katharina Anna Lehmann, Michael Kaufmann, Stephan ...
SPAA
2004
ACM
14 years 1 months ago
Cache-oblivious shortest paths in graphs using buffer heap
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
Rezaul Alam Chowdhury, Vijaya Ramachandran
ICDE
2008
IEEE
142views Database» more  ICDE 2008»
14 years 9 months ago
An Inflationary Fixed Point Operator in XQuery
ct The backbone of the XML data model, namely ordered, unranked trees, is inherently recursive and it is natural to equip the associated languages with constructs that can query su...
Loredana Afanasiev, Torsten Grust, Maarten Marx, J...
ICDE
2007
IEEE
178views Database» more  ICDE 2007»
14 years 9 months ago
Efficient Skyline Query Processing on Peer-to-Peer Networks
Skyline query has been gaining much interest in database research communities in recent years. Most existing studies focus mainly on centralized systems, and resolving the problem...
Shiyuan Wang, Beng Chin Ooi, Anthony K. H. Tung, L...
ICDE
2003
IEEE
138views Database» more  ICDE 2003»
14 years 9 months ago
Using State Modules for Adaptive Query Processing
We present a query architecture in which join operators are decomposed into their constituent data structures (State Modules, or SteMs), and dataflow among these SteMs is managed ...
Vijayshankar Raman, Amol Deshpande, Joseph M. Hell...