Sciweavers

1117 search results - page 180 / 224
» Querying structured data in an unstructured P2P system
Sort
View
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
14 years 9 months ago
Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum
POPL
2007
ACM
14 years 8 months ago
Semantics of static pointcuts in aspectJ
In aspect-oriented programming, one can intercept events by writing patterns called pointcuts. The pointcut language of the most popular aspect-oriented programming language, Aspe...
Pavel Avgustinov, Elnar Hajiyev, Neil Ongkingco, O...
CHI
1993
ACM
13 years 11 months ago
Sifting through hierarchical information
Modern computer users must often sift and manage vast amounts of hierarchically structured information. However, conventional interface tools have not kept pace with the informati...
Doug Schaffer, Saul Greenberg
BMCBI
2010
113views more  BMCBI 2010»
13 years 7 months ago
Efficient protein alignment algorithm for protein search
Background: Proteins show a great variety of 3D conformations, which can be used to infer their evolutionary relationship and to classify them into more general groups; therefore ...
Zaixin Lu, Zhiyu Zhao, Bin Fu
CIDR
2003
147views Algorithms» more  CIDR 2003»
13 years 9 months ago
Sorting And Indexing With Partitioned B-Trees
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read...
Goetz Graefe