Sciweavers

2635 search results - page 168 / 527
» Algorithms for the Database Layout Problem
Sort
View
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
15 years 9 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
JIPS
2010
165views more  JIPS 2010»
14 years 11 months ago
IMTAR: Incremental Mining of General Temporal Association Rules
Nowadays due to the rapid advances in the field of information systems, transactional databases are being updated regularly and/or periodically. The knowledge discovered from these...
Anour F. A. Dafa-Alla, Ho-Sun Shon, Khalid E. K. S...
PODS
2004
ACM
86views Database» more  PODS 2004»
16 years 4 months ago
Frontiers of Tractability for Typechecking Simple XML Transformations
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus...
Wim Martens, Frank Neven
ADC
2008
Springer
110views Database» more  ADC 2008»
15 years 11 months ago
Graph Mining based on a Data Partitioning Approach
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
Son N. Nguyen, Maria E. Orlowska, Xue Li
VLDB
1997
ACM
94views Database» more  VLDB 1997»
15 years 8 months ago
Describing and Using Query Capabilities of Heterogeneous Sources
Information integration systems have to cope with the different and limited query interfaces of the underlying information sources. First, the integration systems need description...
Vasilis Vassalos, Yannis Papakonstantinou