Sciweavers

244 search results - page 24 / 49
» Efficient Approximation Algorithms for Repairing Inconsisten...
Sort
View
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
14 years 8 months ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han
VLDB
2006
ACM
162views Database» more  VLDB 2006»
14 years 8 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
EDBT
2006
ACM
114views Database» more  EDBT 2006»
14 years 8 months ago
Resource Adaptive Periodicity Estimation of Streaming Data
Abstract. Streaming environments typically dictate incomplete or approximate algorithm execution, in order to cope with sudden surges in the data rate. Such limitations are even mo...
Michail Vlachos, Deepak S. Turaga, Philip S. Yu
ICDE
2009
IEEE
114views Database» more  ICDE 2009»
14 years 10 months ago
On Efficient Query Processing of Stream Counts on the Cell Processor
In recent years, the sketch-based technique has been presented as an effective method for counting stream items on processors with limited storage and processing capabilities, such...
Dina Thomas, Rajesh Bordawekar, Charu C. Aggarwal,...
EDBT
2004
ACM
121views Database» more  EDBT 2004»
14 years 8 months ago
LexEQUAL: Supporting Multiscript Matching in Database Systems
To effectively support today's global economy, database systems need to store and manipulate text data in multiple languages simultaneously. Current database systems do suppor...
A. Kumaran, Jayant R. Haritsa