ICDE
2011
IEEE
12 years 8 months ago
2011
IEEE
Abstract—We propose a novel collaborative caching framework to support spatial query processing in Mobile Peer-toPeer Networks (MP2PNs). To maximize cache sharing among clients, ...
CIKM
2010
Springer
13 years 3 months ago
2010
Springer
Current Information Retrieval systems use inverted index structures for efficient query processing. Due to the extremely large size of many data sets, these index structures are u...
TODS
2002
13 years 4 months ago
2002
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
INFSOF
2007
13 years 4 months ago
2007
Although spatio-temporal databases have received considerable attention recently, there has been little work on processing range sum queries on the historical records of moving ob...
DKE
2006
13 years 4 months ago
2006
Existing encoding schemes and index structures proposed for XML query processing primarily target the containment relationship, specifically the parent
ER
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. Both Geographic Information Systems and Information Retrieval have been very active research fields in the last decades. Lately, a new research field called Geographic In...
VLDB
1994
ACM
13 years 8 months ago
1994
ACM
Index structures for multiple sets can be classified into those that group entries according to their key values and those that group entries according to their set membership. Th...
VLDB
1997
ACM
13 years 8 months ago
1997
ACM
Abstract: Recently there has been an increasing interest in supporting bulk operations on multidimensional index structures. Bulk loading refers to the process of creating an initi...
SIGMOD
1998
ACM
13 years 8 months ago
1998
ACM
Databases are increasingly being used to store multi-media objects such as maps, images, audio and video. Storage and retrieval of these objects is accomplished using multi-dimens...
ADC
2000
Springer
13 years 9 months ago
2000
Springer
While the B-tree (or the B+ -tree) is the most popular index structure in disk-based relational database systems, the Ttree has been widely accepted as a promising index structure...