Sciweavers

3652 search results - page 318 / 731
» A study of query length
Sort
View
129
Voted
GIS
1997
ACM
15 years 7 months ago
Speeding up Bulk-Loading of Quadtrees
Spatial indexes, such as the PMR quadtree, are important in spatial databases for efficient execution of queries involving spatial constraints, especially when the queries involve...
Gísli R. Hjaltason, Hanan Samet, Yoram J. S...
118
Voted
DBKDA
2009
IEEE
88views Database» more  DBKDA 2009»
15 years 7 months ago
Replay the Execution History of Rule-Based Information
Software systems in health care, such as disease and medical-record management, or financial applications, such as customer relationship and portfolio management, have very often...
Essam Mansour, Hagen Höpfner
111
Voted
AAAI
2004
15 years 5 months ago
Shortest Path Discovery Problems: A Framework, Algorithms and Experimental Results
In this paper we introduce and study Shortest Path Discovery (SPD) problems, a generalization of shortest path problems: In SPD one is given a directed edgeweighted graph and the ...
Csaba Szepesvári
134
Voted
PVLDB
2010
269views more  PVLDB 2010»
15 years 2 months ago
Shortest Path Computation on Air Indexes
Shortest path computation is one of the most common queries in location-based services that involve transportation networks. Motivated by scalability challenges faced in the mobil...
Georgios Kellaris, Kyriakos Mouratidis
149
Voted
SODA
2010
ACM
144views Algorithms» more  SODA 2010»
15 years 2 months ago
Cell-Probe Lower Bounds for Succinct Partial Sums
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
Mihai Patrascu, Emanuele Viola