Sciweavers

3020 search results - page 242 / 604
» Similarity Queries on Structured Data in Structured Overlays
Sort
View
CIKM
2009
Springer
15 years 10 months ago
Efficient processing of group-oriented connection queries in a large graph
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
James Cheng, Yiping Ke, Wilfred Ng
MOBIDE
2005
ACM
16 years 8 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
SIGMOD
2011
ACM
219views Database» more  SIGMOD 2011»
14 years 9 months ago
Context-sensitive ranking for document retrieval
We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by do...
Liang Jeff Chen, Yannis Papakonstantinou
WWW
2007
ACM
16 years 7 months ago
SPARQ2L: towards support for subgraph extraction queries in rdf databases
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
Kemafor Anyanwu, Angela Maduko, Amit P. Sheth
BTW
2009
Springer
117views Database» more  BTW 2009»
15 years 10 months ago
Bringing BLINK Closer to the Full Power of SQL
: BLINK is a prototype of an in-memory based query processor that exploits heavily the underlying CPU infrastructure. It is very sensitive to the processor’s caches and instructi...
Knut Stolze, Vijayshankar Raman, Richard Sidle, O....