2001 search results - page 285 / 401 » Indexing in a Hypertext Database |
WWW
2008
ACM
14 years 11 months ago
2008
ACM
Recent interests on XML, Semantic Web, and Web ontology, among other topics, have sparked a renewed interest on graph-structured databases. A fundamental query on graphs is the re...
EDBT
2009
ACM
14 years 5 months ago
2009
ACM
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
VLDB
2004
ACM
14 years 3 months ago
2004
ACM
It is well established that bitmap indices are efficient for read-only attributes with low attribute cardinalities. For an attribute with a high cardinality, the size of the bitma...
WWW
2010
ACM
14 years 3 months ago
2010
ACM
Typical approaches for querying structured Web Data collect (crawl) and pre-process (index) large amounts of data in a central data repository before allowing for query answering....
DOLAP
2003
ACM
14 years 3 months ago
2003
ACM
The data cube operator exemplifies two of the most important aspects of OLAP queries: aggregation and dimension hierarchies. In earlier work we presented Dwarf, a highly compress...