Sciweavers

332 search results - page 30 / 67
» Space Complexity vs. Query Complexity
Sort
View
GIS
2010
ACM
13 years 8 months ago
Scalable shortest paths browsing on land surface
The growing popularity of online Earth visualization tools and geo-realistic games and the availability of high resolution terrain data have motivated a new class of queries to th...
Songhua Xing, Cyrus Shahabi
SIGMOD
2009
ACM
219views Database» more  SIGMOD 2009»
14 years 10 months ago
Hermes: a travel through semantics on the data web
The Web as a global information space is developing from a Web of documents to a Web of data. This development opens new ways for addressing complex information needs. Search is n...
Haofen Wang, Thomas Penin, Kaifeng Xu, Junquan Che...
COMPGEOM
2010
ACM
14 years 3 months ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
VLDB
2002
ACM
106views Database» more  VLDB 2002»
13 years 9 months ago
Structure and Value Synopses for XML Data Graphs
All existing proposals for querying XML (e.g., XQuery) rely on a pattern-specification language that allows (1) path navigation and branching through the label structure of the XM...
Neoklis Polyzotis, Minos N. Garofalakis
ESAW
2009
Springer
14 years 4 months ago
Peer-to-Peer Overlay Network Based on Swarm Intelligence
As the number of information in the Internet constantly increases and the complexity of systems rapidly grows, locating and manipulating complex data has become a difficult task. W...
Vesna Sesum-Cavic, eva Kühn