Sciweavers

559 search results - page 1 / 112
» Indexing Weighted-Sequences in Large Databases
Sort
View
ICDE
2003
IEEE
149views Database» more  ICDE 2003»
14 years 5 months ago
Indexing Weighted-Sequences in Large Databases
We present an index structure for managing weightedsequences in large databases. A weighted-sequence is defined as a two-dimensional structure where each element in the sequence i...
Haixun Wang, Chang-Shing Perng, Wei Fan, Sanghyun ...
JCP
2006
173views more  JCP 2006»
13 years 3 months ago
Database Intrusion Detection using Weighted Sequence Mining
Data mining is widely used to identify interesting, potentially useful and understandable patterns from a large data repository. With many organizations focusing on webbased on-lin...
Abhinav Srivastava, Shamik Sural, Arun K. Majumdar
CIKM
2010
Springer
13 years 2 months ago
A hierarchical approach to reachability query answering in very large graph databases
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
Saikat K. Dey, Hasan M. Jamil
DATAMINE
1999
113views more  DATAMINE 1999»
13 years 3 months ago
A Fast Parallel Clustering Algorithm for Large Spatial Databases
The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper,...
Xiaowei Xu, Jochen Jäger, Hans-Peter Kriegel
PVLDB
2010
200views more  PVLDB 2010»
13 years 2 months ago
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Shijie Zhang, Jiong Yang, Wei Jin