Sciweavers

2121 search results - page 64 / 425
» Indexing Incomplete Databases
Sort
View
ADC
2004
Springer
88views Database» more  ADC 2004»
15 years 6 months ago
An Efficient Method for Indexing Now-relative Bitemporal data
Most modern database applications contain a significant amount of time dependent data and a substantial proportion of this data is now-relative, i.e. current now. While much resea...
Bela Stantic, Sankalp Khanna, John Thornton
PVLDB
2010
200views more  PVLDB 2010»
15 years 21 days 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
PODS
1997
ACM
117views Database» more  PODS 1997»
15 years 6 months ago
On the Analysis of Indexing Schemes
We consider the problem of indexing general database workloads (combinations of data sets and sets of potential queries). We de ne a framework for measuring the eciency of an ind...
Joseph M. Hellerstein, Elias Koutsoupias, Christos...
MLDM
1999
Springer
15 years 6 months ago
Non-hierarchical Clustering with Rival Penalized Competitive Learning for Information Retrieval
In large content-based image database applications, e cient information retrieval depends heavily on good indexing structures of the extracted features. While indexing techniques f...
Irwin King, Tak-Kan Lau
DASFAA
2008
IEEE
149views Database» more  DASFAA 2008»
15 years 8 months ago
Index-Supported Similarity Search Using Multiple Representations
Similarity search in complex databases is of utmost interest in a wide range of application domains. Often, complex objects are described by several representations. The combinatio...
Johannes Aßfalg, Michael Kats, Hans-Peter Kr...