Sciweavers

327 search results - page 65 / 66
» Efficiently querying rdf data in triple stores
Sort
View
VLDB
2005
ACM
126views Database» more  VLDB 2005»
13 years 10 months ago
Hubble: An Advanced Dynamic Folder Technology for XML
A significant amount of information is stored in computer systems today, but people are struggling to manage their documents such that the information is easily found. XML is a de...
Ning Li, Joshua Hui, Hui-I Hsiao, Kevin S. Beyer
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
13 years 9 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
EDBT
2008
ACM
122views Database» more  EDBT 2008»
14 years 5 months ago
Semantic peer, here are the neighbors you want!
Peer Data Management Systems (PDMSs) have been introduced as a solution to the problem of large-scale sharing of semantically rich data. A PDMS consists of semantic peers connecte...
Wilma Penzo, Stefano Lodi, Federica Mandreoli, Ric...
WISES
2003
13 years 6 months ago
Locating Moving Objects over Mobile Sensor Network
The purpose of our on going research would be to track entities, which enter their field of vision over the sensor network. Based on their sightings, they maintain a dynamic cache ...
Arvind Nath Rapaka, Sandeep Bogollu, Donald C. Wun...
IDEAS
2007
IEEE
135views Database» more  IDEAS 2007»
13 years 11 months ago
Bitmap Index Design Choices and Their Performance Implications
Historically, bitmap indexing has provided an important database capability to accelerate queries. However, only a few database systems have implemented these indexes because of t...
Elizabeth J. O'Neil, Patrick E. O'Neil, Kesheng Wu