2121 search results - page 303 / 425 » Indexing Incomplete Databases |
283
click to vote
ICDE
2003
IEEE
16 years 7 months ago
2003
IEEE
A plethora of data sources contain data entities that could be ordered according to a variety of attributes associated with the entities. Such orderings result effectively in a ra...
170
click to vote
WWW
2008
ACM
16 years 7 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...
186
click to vote
EDBT
2009
ACM
16 years 1 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...
184
click to vote
VLDB
2004
ACM
15 years 11 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...
180
click to vote
WWW
2010
ACM
15 years 11 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....