NDLI: What we talk about when we talk about graphs

Please wait, while we are loading the content...

Data warehouse testing

Assessing linkset quality for complementing third-party datasets

Supporting range queries in XML keyword search

Efficient tree pattern queries on encrypted XML documents

What we talk about when we talk about graphs

Symbolic representation of smart meter data

Towards design support for provenance awareness: a classification of provenance questions

Provenance for seismological processing pipelines in a distributed streaming workflow

VisTrails provenance traces for benchmarking

Efficient parallel partition-based algorithms for similarity search and join with edit distance constraints

A declarative approach to customize workflow provenance

Structure inference for linked data sources using clustering

A flexible framework for context-aware recommendations in the social commerce domain

Design and implementation of privacy-preserving reconciliation protocols

Towards query model integration: topology-aware, IR-inspired metrics for declarative graph querying

Visualizing complex energy planning objects with inherent flexibilities

Capturing and querying workflow runtime provenance with PROV: a practical approach

Enhancing and abstracting scientific workflow provenance for data publishing

Provenance traces of the swift parallel scripting system

Trying to outperform a well-known index with a sequential scan

Multidimensional process mining: a flexible analysis approach for health services research

Improving geo-spatial linked data with the wisdom of the crowds

A privacy framework: indistinguishable privacy

Performance of graph query languages: comparison of cypher, gremlin and native access in Neo4j

Towards ontological foundations of knowledge related to the emissions trading system

Provenance from log files: a BigData problem

Using provenance to analyse agent-based simulations

Extracting PROV provenance traces from Wikipedia history pages

Efficient high-similarity string comparison: the waterfall algorithm

Towards efficient and practical solutions for ontology-based data management

Linked data classification: a feature-based approach

A theoretical model for obfuscating web navigation trails

A similarity measure for approximate querying over RDF data

Optimized renewable energy forecasting in local distribution networks

WebLab PROV: computing fine-grained provenance links for XML artifacts

A workflow PROV-corpus based on taverna and wings

WallBreaker: overcoming the wall effect in similarity search

Database support for processing complex aggregate queries over data streams

Semantic question answering system over linked data using relational patterns

Anonymizing sequential releases under arbitrary updates

On implementing provenance-aware regular path queries with relational query engines

Towards the automated extraction of flexibilities from electricity time series

PROV-O provenance traces from agent-based social simulation

Scalable string similarity search/join with approximate seeds and multiple backtracking

Discovery querying in linked open data

LOVER: support for modeling data using linked open vocabularies

Secure multiparty aggregation with differential privacy: a comparative study

Dynamic multi-version ontology-based personalization

Research challenges for energy data management (panel)

Cross-platform provenance

Efficient edit distance based string similarity search using deletion neighborhoods

Mining irregularities in maritime container itineraries

Community evolution detection in time-evolving information networks

Monitoring and recommending privacy settings in social networks

Finding nearest neighbors in road networks: a tree decomposition method

Provenance traces from Chiron parallel workflow engine

Approximate string matching by position restricted alignment

Biometric access control for e-health records in pre-hospital care

Provenance in streamflow forecasting

Trie-based similarity search and join

A privacy preserving model bridging data provider and collector preferences

FPI: a novel indexing method using frequent patterns for approximate string searches

A trustworthy database for privacy-preserving video surveillance

Cache-aware parallel approximate matching and join algorithms using BWT

What we talk about when we talk about graphs

Content Provider	ACM Digital Library
Author	Fletcher, George H. L.
Abstract	An old idea from the humanistic sciences has it that the language we use not only restricts the manner in which we view the world, but also, in a very real sense, shapes the world around us. This view has deep roots across fields as diverse as anthropology, linguistics, and philosophy. Recently, my colleagues and I have been exploring the interesting ways in which this idea manifests itself in data management. In particular, we have been studying the expressive power of graph query languages at the instance level, where the focus is on characterizing the ability of languages to restrict and shape concrete graph instances, purely in terms of the structure of the instances. In this talk, I will begin with a brief recap of such structural characterizations of query languages for structured and semi-structured data [4, 7, 8]. I will then introduce the theoretical framework we have been developing for reasoning over graph structured data [1, 2, 3, 6]. Following this, I will discuss how we put the framework to work, with the design of structural indexes for (RDF) graphs [5, 12]. I will also give an overview of our recent results on effectively computing the characterizations on which these index data structures are built [9, 10, 11]. Finally, I will conclude with a discussion of broader applications of the framework in data management and indications for further research.
Starting Page	184
Ending Page	184
Page Count	1
File Format	PDF
ISBN	9781450315999
DOI	10.1145/2457317.2457349
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2013-03-18
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in