Sciweavers

1888 search results - page 260 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
PODS
2006
ACM
216views Database» more  PODS 2006»
14 years 9 months ago
Cache-oblivious string B-trees
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...
VLDB
2007
ACM
135views Database» more  VLDB 2007»
14 years 3 months ago
Self-Organizing Schema Mappings in the GridVine Peer Data Management System
GridVine is a Peer Data Management System based on a decentralized access structure. Built following the principle of data independence, it separates a logical layer – where dat...
Philippe Cudré-Mauroux, Suchit Agarwal, Adr...
WEBDB
2007
Springer
79views Database» more  WEBDB 2007»
14 years 3 months ago
Navigating Extracted Data with Schema Discovery
Open Information Extraction (OIE) is a recently-introduced type of information extraction that extracts small individual pieces of data from input text without any domainspecific...
Michael J. Cafarella, Dan Suciu, Oren Etzioni
SIGMETRICS
2012
ACM
247views Hardware» more  SIGMETRICS 2012»
11 years 11 months ago
A scalable architecture for maintaining packet latency measurements
Latency has become an important metric for network monitoring since the emergence of new latency-sensitive applications (e.g., algorithmic trading and high-performance computing)....
Myungjin Lee, Nick G. Duffield, Ramana Rao Kompell...
ICPP
2006
IEEE
14 years 3 months ago
A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
Srikanta Tirthapura, Sudip Seal, Srinivas Aluru