Sciweavers

258 search results - page 33 / 52
» Partitioning of Java Applications to Support Dynamic Updates
Sort
View
PVLDB
2010
195views more  PVLDB 2010»
14 years 8 months ago
Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints
A string similarity join finds similar pairs between two collections of strings. It is an essential operation in many applications, such as data integration and cleaning, and has ...
Jiannan Wang, Guoliang Li, Jianhua Feng
PVLDB
2010
134views more  PVLDB 2010»
15 years 9 days ago
High-Performance Dynamic Pattern Matching over Disordered Streams
Current pattern-detection proposals for streaming data recognize the need to move beyond a simple regular-expression model over strictly ordered input. We continue in this directi...
Badrish Chandramouli, Jonathan Goldstein, David Ma...
CPM
2008
Springer
134views Combinatorics» more  CPM 2008»
15 years 3 months ago
An Improved Succinct Representation for Dynamic k-ary Trees
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
Diego Arroyuelo
WWW
2003
ACM
16 years 2 months ago
High-performance spatial indexing for location-based services
Much attention has been accorded to Location-Based Services and location tracking, a necessary component in active, trigger-based LBS applications. Tracking the location of a larg...
Jussi Myllymaki, James H. Kaufman
CASCON
1996
102views Education» more  CASCON 1996»
15 years 3 months ago
Availability management of distributed programs and services
Modern distributed applications pose increasing demands for high availability, automatic management, and dynamic con guration of their software systems. This paper presents the ar...
Markus Endler