958 search results - page 65 / 192 » Efficient data structures for range-aggregate queries on tre... |
118
Voted
IKE
2003
14 years 11 months ago
2003
Inverted files are widely used to index documents in large-scale information retrieval systems. An inverted file consists of posting lists, which can be stored in either a documen...
156
click to vote
SIGMOD
2007
ACM
15 years 10 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
96
Voted
SIAMCOMP
1998
14 years 10 months ago
1998
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
101
Voted
DASFAA
2004
IEEE
15 years 2 months ago
2004
IEEE
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
90
Voted
ICDE
2005
IEEE
15 years 3 months ago
2005
IEEE
Sybase's flagship database product, Adaptive Server Enterprise provides Native XML processing (NXS) support. In this paper we present our experience related to query processi...