-
1
-
-
28444457488
-
-
http://www.tibco.com.
-
-
-
-
2
-
-
28444491158
-
-
http://www.sap.de.
-
-
-
-
3
-
-
28444465582
-
-
http://www.microsoft.com/biztalk/.
-
-
-
-
4
-
-
28444440329
-
-
http://www.bea.com.
-
-
-
-
5
-
-
28444474639
-
-
http://www.ipd.bth.se/ska/sim_home/ libghthash.html.
-
-
-
-
6
-
-
0002176154
-
Querying semi-structured data
-
S. Abiteboul. Querying Semi-Structured Data. In ICDT, 1997.
-
(1997)
ICDT
-
-
Abiteboul, S.1
-
7
-
-
0032656633
-
Matching events in a content-based subscription system
-
M. Aguilera, R. Strom, D. Sturman, M. Astley, and T. Chandra. Matching Events in a Content-Based Subscription System. In Symposium on Principles of Distributed Computing, pages 53-61, 1999.
-
(1999)
Symposium on Principles of Distributed Computing
, pp. 53-61
-
-
Aguilera, M.1
Strom, R.2
Sturman, D.3
Astley, M.4
Chandra, T.5
-
8
-
-
0025447750
-
The R*-tree: An efficient and robust access method for points and rectangles
-
N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles. In SIGMOD, 1990.
-
(1990)
SIGMOD
-
-
Beckmann, N.1
Kriegel, H.2
Schneider, R.3
Seeger, B.4
-
9
-
-
28444487526
-
An evaluation of generic bulk loading techniques
-
J. Bercken and B. Seeger. An Evaluation of Generic Bulk Loading Techniques. In VLDB, 2001.
-
(2001)
VLDB
-
-
Bercken, J.1
Seeger, B.2
-
10
-
-
0032687305
-
The bulk index join: A generic approach to processing non-equijoins
-
J. Bercken, B. Seeger, and P. Widmayer. The bulk index join: A generic approach to processing non-equijoins. In ICDE, 1999.
-
(1999)
ICDE
-
-
Bercken, J.1
Seeger, B.2
Widmayer, P.3
-
11
-
-
0042418190
-
Streaming queries over streaming data
-
S. Chandresakaran and M. Franklin. Streaming Queries over Streaming Data. In VLDB, 2002.
-
(2002)
VLDB
-
-
Chandresakaran, S.1
Franklin, M.2
-
12
-
-
28444432775
-
GBI: A generalized R-tree bulk-insertion strategy
-
R. Choubey, L. Chen, and E. Rundensteiner. GBI: A Generalized R-Tree Bulk-Insertion Strategy. In SSD, 1999.
-
(1999)
SSD
-
-
Choubey, R.1
Chen, L.2
Rundensteiner, E.3
-
13
-
-
3042746680
-
Path sharing and predicate evaluation for high-performance XML filtering
-
Y. Diao, M. Altinel, M. J. Franklin, H. Zhang, and P. Fischer. Path Sharing and Predicate Evaluation for High-Performance XML Filtering. TODS, 2003.
-
(2003)
TODS
-
-
Diao, Y.1
Altinel, M.2
Franklin, M.J.3
Zhang, H.4
Fischer, P.5
-
14
-
-
0034826382
-
Filtering algorithms and implementation for very fast publish/subscribe systems
-
F. Fabret, H. A. Jacobsen, F. Llirbat, J. Pereira, K. A. Ross, and D. Shasha. Filtering Algorithms and Implementation for Very Fast Publish/Subscribe Systems. In SIGMOD, 2001.
-
(2001)
SIGMOD
-
-
Fabret, F.1
Jacobsen, H.A.2
Llirbat, F.3
Pereira, J.4
Ross, K.A.5
Shasha, D.6
-
16
-
-
0021615874
-
R-trees: A dynamic index structure for spatial searching
-
A. Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching. In SIGMOD, 1984.
-
(1984)
SIGMOD
-
-
Guttman, A.1
-
17
-
-
0030148521
-
Selection predicate indexing for active databases using interval skip lists
-
E. Hanson and T. Johnson. Selection Predicate Indexing for Active Databases Using Interval Skip Lists. Information Systems, 21(3):269-298, 1996.
-
(1996)
Information Systems
, vol.21
, Issue.3
, pp. 269-298
-
-
Hanson, E.1
Johnson, T.2
-
19
-
-
84976655848
-
The case for partial indexes
-
M. Stonebraker. The Case for Partial Indexes. SIGMOD Record, 18(4):4-11, 1989.
-
(1989)
SIGMOD Record
, vol.18
, Issue.4
, pp. 4-11
-
-
Stonebraker, M.1
-
20
-
-
28444468200
-
-
http://valgrind.kde.org/.
-
-
-
-
21
-
-
85012136609
-
Buffering accesses to memory-resident index structures
-
J. Zhou and K. A. Ross. Buffering Accesses to Memory-Resident Index Structures. In VLDB, 2003.
-
(2003)
VLDB
-
-
Zhou, J.1
Ross, K.A.2
|