Sciweavers

1890 search results - page 166 / 378
» Querying Big Data by Accessing Small Data
Sort
View
MOBIDE
2005
ACM
16 years 3 days 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
WEBDB
2005
Springer
83views Database» more  WEBDB 2005»
16 years 12 hour ago
Indexing for XML Siblings
Efficient querying XML documents is an increasingly important issue considering the fact that XML becomes the de facto standard for data representation and exchange over the Web,...
SungRan Cho
PVLDB
2008
108views more  PVLDB 2008»
15 years 6 months ago
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
16 years 7 months ago
The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
Hans-Peter Kriegel, Jörn Kohlhammer, Martin E...
SIGMOD
2007
ACM
167views Database» more  SIGMOD 2007»
16 years 6 months ago
Data currency in replicated DHTs
Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in P2P systems. To ensure high data availability, DHTs typically rely on data replication, yet without ...
Reza Akbarinia, Esther Pacitti, Patrick Valduriez