Sciweavers

2070 search results - page 262 / 414
» Querying Communities in Relational Databases
Sort
View
SIGMOD
2002
ACM
148views Database» more  SIGMOD 2002»
16 years 6 months ago
Accelerating XPath location steps
This work is a proposal for a database index structure that has been specifically designed to support the evaluation of XPath queries. As such, the index is capable to support all...
Torsten Grust
ICDE
2010
IEEE
224views Database» more  ICDE 2010»
16 years 6 months ago
Probabilistic Declarative Information Extraction
Abstract-Unstructured text represents a large fraction of the world's data. It often contain snippets of structured information within them (e.g., people's names and zip ...
Daisy Zhe Wang, Eirinaios Michelakis, Joseph M. He...
EDBT
2010
ACM
147views Database» more  EDBT 2010»
16 years 27 days ago
A simple (yet powerful) algebra for pervasive environments
Querying non-conventional data is recognized as a major issue in new environments and applications such as those occurring in pervasive computing. A key issue is the ability to qu...
Yann Gripay, Frédérique Laforest, Je...
PODS
2009
ACM
130views Database» more  PODS 2009»
16 years 7 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti
ICDT
2012
ACM
242views Database» more  ICDT 2012»
13 years 8 months ago
Win-move is coordination-free (sometimes)
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...
Daniel Zinn, Todd J. Green, Bertram Ludäscher