Sciweavers

223 search results - page 20 / 45
» Expressive and Efficient Peer-to-Peer Queries
Sort
View
ICDE
2002
IEEE
206views Database» more  ICDE 2002»
14 years 8 months ago
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
Raghav Kaushik, Pradeep Shenoy, Philip Bohannon, E...
SIGMOD
2007
ACM
225views Database» more  SIGMOD 2007»
14 years 6 months ago
From complete to incomplete information and back
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
Lyublena Antova, Christoph Koch, Dan Olteanu
VLDB
2007
ACM
126views Database» more  VLDB 2007»
14 years 7 months ago
Querying Complex Structured Databases
Correctly generating a structured query (e.g., an XQuery or a SQL query) requires the user to have a full understanding of the database schema, which can be a daunting task. Alter...
Cong Yu, H. V. Jagadish
NJC
2006
102views more  NJC 2006»
13 years 6 months ago
Online Evaluation of Regular Tree Queries
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
Alexandru Berlea
SODA
2010
ACM
213views Algorithms» more  SODA 2010»
14 years 4 months ago
Regular Expression Matching with Multi-Strings
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
Philip Bille, Mikkel Thorup