2985 search results - page 82 / 597 » Indexing Distributed Complex Data for Complex Queries |
158
click to vote
ICCS
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...
135
click to vote
VLDB
2005
ACM
15 years 10 months ago
2005
ACM
This paper addresses the efficient processing of top-k queries in wide-area distributed data repositories where the index lists for the attribute values (or text terms) of a query...
147
click to vote
CIKM
2010
Springer
15 years 3 months ago
2010
Springer
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...
160
click to vote
MDM
2009
Springer
15 years 11 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
150
click to vote
ICEBE
2005
IEEE
15 years 10 months ago
2005
IEEE
Over a traditional Database Management System (DBMS), the answer to an aggregate query is usually much smaller than the answer to a similar nonaggregate query. Therefore, we call ...