Sciweavers

334 search results - page 34 / 67
» Scalable complex pattern search in sequential data
Sort
View
ICDE
2005
IEEE
144views Database» more  ICDE 2005»
14 years 10 months ago
ViteX: A Streaming XPath Processing System
We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...
Yi Chen, Susan B. Davidson, Yifeng Zheng
GECCO
2007
Springer
308views Optimization» more  GECCO 2007»
14 years 3 months ago
Multiobjective clustering with automatic k-determination for large-scale data
Web mining - data mining for web data - is a key factor of web technologies. Especially, web behavior mining has attracted a great deal of attention recently. Behavior mining invo...
Nobukazu Matake, Tomoyuki Hiroyasu, Mitsunori Miki...
ALGORITHMICA
2004
132views more  ALGORITHMICA 2004»
13 years 9 months ago
A General Model for Authenticated Data Structures
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
Charles U. Martel, Glen Nuckolls, Premkumar T. Dev...
CIKM
2011
Springer
12 years 9 months ago
Block-based load balancing for entity resolution with MapReduce
The effectiveness and scalability of MapReduce-based implementations of complex data-intensive tasks depend on an even redistribution of data between map and reduce tasks. In the...
Lars Kolb, Andreas Thor, Erhard Rahm
GLOBECOM
2007
IEEE
14 years 3 months ago
Parallel Search Trie-Based Scheme for Fast IP Lookup
—As data rates in the Internet increase, the Internet Protocol (IP) address lookup is required to be resolved in shorter resolution times. IP address lookup involves finding the...
Roberto Rojas-Cessa, Lakshmi Ramesh, Ziqian Dong, ...