Sciweavers

552 search results - page 48 / 111
» Efficient Algorithms for Processing XPath Queries
Sort
View
115
Voted
CIKM
2008
Springer
15 years 4 months ago
PROQID: partial restarts of queries in distributed databases
In a number of application areas, distributed database systems can be used to provide persistent storage of data while providing efficient access for both local and remote data. W...
Jon Olav Hauglid, Kjetil Nørvåg
129
Voted
EDBT
2009
ACM
156views Database» more  EDBT 2009»
15 years 6 months ago
Efficient skyline retrieval with arbitrary similarity measures
A skyline query returns a set of objects that are not dominated by other objects. An object is said to dominate another if it is closer to the query than the latter on all factors...
Deepak P, Prasad M. Deshpande, Debapriyo Majumdar,...
244
Voted

Publication
309views
17 years 2 months ago
SOLE: Scalable On-Line Execution of Continuous Queries on Spatio-temporal Data Streams
This paper presents the Scalable On-Line Execution algorithm (SOLE, for short) for continuous and on-line evaluation of concurrent continuous spatio- temporal queries over data str...
Mohamed F. Mokbel, Walid G. Aref
130
Voted
MOBIDE
2005
ACM
15 years 8 months ago
Tolerance of localization imprecision in efficiently managing mobile sensor databases
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...
Lin Xiao, Aris M. Ouksel
192
Voted
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
16 years 2 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis