• 学术搜索
  • 科研智能体
    • Research Labs
    • AI 阅读
    • AI 文库
    • 深度研究
    • 学者亮点
  • 学术资源
    • AI2000
    • 期刊/会议
    • 学者库
    • 学术API
      MCP&Skill
    • 溯源树
    • 数据集
  • 知识沉淀
    • 学术空间
订阅小程序
旧版功能
aminer vip
开通会员低至0.73元/天
一次搞定AI科研
立即登录
  • English
  • 联系方式
    M

    Mississippi Department of Education

    17论文总数
    97引用总数

    The Mississippi Department of Education (MDE) is the state education agency of Mississippi. It is headquartered in the former Central High School Building at 359 North West Street in Jackson.The State Superintendent of Education is Carey M. Wright.

    论文量&引用量时间轴

    机构学者

    论文(17)

    年份
    起
    –
    止
    排序
    1Synergistic Synthesis-Guided Parallel Incremental Optimization (SSPIO): A Unified Framework for Recursive, Comparative, and Nested Aggregate Query Processing
    Ramachandra Reddy Vangala

    Modern analytical workloads increasingly rely on recursive computations, correlated nested aggregates, comparison-heavy conjunctive queries, and massively parallel joins. Traditional query optimizers, which focus primarily on loop-free relational algebra, struggle to address the combinatorial explosion of recursive evaluation, join ordering, and incremental maintenance. In this paper, we propose a novel framework called Synergistic Synthesis-Guided Parallel Incremental Optimization (SSPIO), which integrates program synthesis, constraint-guided rewrite discovery, acyclic comparison evaluation, parallel join enumeration, and incremental aggregate indexing into a unified optimization architecture. SSPIO introduces a new meta-optimization paradigm that combines synthesis-based recursive rewriting with constraint-aware equivalence verification and parallel search-space pruning. Furthermore, we propose a novel data structure, the Comparative Recursive Partial Aggregate Graph (CRPAG), which generalizes partial aggregate indexes and acyclic comparison structures for recursive and correlated nested queries. Experimental evaluation demonstrates substantial performance improvements in recursive Datalog programs, SQL workloads with nested aggregates, and large multi-join analytical queries. SSPIO achieves up to three orders of magnitude speedup compared to baseline systems while maintaining provable correctness guarantees.

    2026Journal of Artificial intelligence and Machine Learning(2026)
    引用
    AI阅读
    加入学术空间
    2CODAQ: Context-Oriented Distributed Adaptive Query Processing for Large-Scale Graph and Data Systems
    Praveen Kumar Kumbum,Ramachandra Reddy Vangala

    Modern data-driven applications increasingly rely on distributed graph databases and machine learning pipelines to extract knowledge from massive datasets. However, efficient query processing in distributed environments remains challeng-ing due to issues such as graph partitioning inefficiencies, dynamic connectivity updates, privacy constraints, and suboptimal ranking of query results. Exist- ing systems typically address these issues independently, resulting in fragmented solutions that do not fully optimize query execution, data preparation, and result retrieval simultaneously. This paper proposesCODAQ (Context-Oriented Distributed Adaptive Query Processing), a novel unified framework that integrates connectivity- aware graph partitioning, constant-time dynamic connectivity indexing, context- aware pipeline optimization, directional ranking for balanced top-k results, and disclosure-compliant query rewriting. CODAQ reduces crosspartition communi-cation, dynamically maintains graph connectivity structures, learns optimal data preparation pipelines using contextual embeddings, and ensures secure data dis-closure while maintaining result relevance. Experimental evaluation demonstrates that CODAQ improves query throughput by up to 65%, reduces communica- tion overhead by 70%, and achieves higher accuracy in data-driven applications compared to existing distributed query processing frameworks.

    2025Journal of Business Intelligence and Data Analytics(2025)
    引用
    AI阅读
    加入学术空间
    3SPARC-Stream: A Sketch-Based Privacy-AwareResilient Compression Framework for High-Throughput Graph Stream Analytics
    Praveen Kumar Kumbum,Ramachandra Reddy Vangala

    Modern data-intensive applications generate massive graph-structured data streams from social networks, financial systems, sensor infrastructures, and online services. Extracting meaningful insights such as heavy hitters, dense communities, and neighborhood relationships from these streams requires algorithms that are memory-efficient, privacy-aware, and capable of operating under dynamic conditions involving insertions and deletions. Existing approaches address individual challenges such as heavy hitter detection, dense subgraph discovery, or compression independently, but fail to provide a unified framework capable of supporting multiple analytical tasks while ensuring persistence efficiency and privacy guarantees. This paper proposes SPARC-Stream (Sketch-based Privacy-Aware Resilient Compression Stream Framework), a novel architecture designed for scalable graph stream analytics. The proposed technique integrates four key components: (i) a Universal Graph Sketch that simultaneously estimates heavy hitters, frequency moments, and neighborhood structures; (ii) a Compressed Time-Series Edge Encoding module for efficient floating-point data representation; (iii) a Persistent Epoch Buffer inspired by NVM- based buffered persistence; and (iv) a Differentially Private Neighborhood Estimator. Together, these components enable accurate and efficient online analytics over high-volume graph streams. Extensive experimental evaluation demonstrates that SPARCStream improves analytical throughput by up to 2.7x while reducing memory consumption by 45% compared to state-of-the-art techniques.

    2025International Journal of Cloud Computing and Supply Chain Management(2025)
    引用
    AI阅读
    加入学术空间
    4HYPERION-Q: A Graph-Guided Self-Validating and Hardware-Aware Framework for High-Performance Query Processing
    Praveen Kumar Kumbum,Ramachandra Reddy Vangala

    Modern data management systems must simultaneously address three critical challenges: efficient query optimization for large queries, reliable detection of logical errors in database engines, and high-performance processing across heterogeneous hardware architectures. Traditional query optimizers rely on dynamic programming strategies that exhibit exponential complexity when evaluating join orders. At the same time, ensuring correctness of query execution engines remains difficult due to the absence of reliable ground truth for validating complex queries, particularly in spatial and analytical workloads. Moreover, the increasing availability of high-performance hardware such as GPUs and NVMe storage arrays demands new system architectures capable of exploiting these resources effectively. In this paper, we propose HYPERION-Q, a novel framework that integrates graph-guided query optimization, self-validating query testing, and hardwareaware execution planning. The framework combines three complementary ideas: (i) a graph-based join enumeration strategy that extends subset convolution techniques for accelerated optimization, (ii) a transformation-invariant validation mechanism inspired by affine-equivalent query generation to detect logical inconsistencies, and (iii) a hardware-aware execution planner that dynamically maps operators to GPU and NVMe storage paths. The proposed framework significantly improves query optimization efficiency while ensuring correctness and high throughput. Experimental results demonstrate that HYPERION-Q improves query planning speed by up to 35× and increases processing throughput by 2.8× compared to baseline systems.

    2024Journal of Data Science and Information Technology(2024)
    引用
    AI阅读
    加入学术空间
    5Entry Points: Gaining Momentum in Early-Stage Cross-Boundary Collaborations
    Eva Flavia Martinez Orbegozo,Jorrit de Jong,Hannah Riley Bowles,Amy Edmondson, Anahide Nahhal, Lisa Cox

    To address complex social challenges, it is widely recognized that leaders from public, for-profit, and civic organizations should join forces. Yet, well-intended collaborators often struggle to achieve alignment and fail to gain traction in their joint efforts. This article proposes the concept of “entry points” as a key milestone in a collaboration's early stages. Using a unique set of rich, longitudinal data, we examine how ten cross-boundary teams with representation from ten city governments in North America and Europe searched for these entry points (i.e., opportunities for focused action to advance learning and progress towards their collective goals). Based on systematic coding, we propose factors that impeded or enabled the teams' abilities to find entry points in their collaborative work. The paper contributes to literatures on cross-boundary collaboration, problem-oriented governance, and paradoxes in organizational behavior, and it offers an analytic framework to help cross-boundary collaboration practitioners identify their entry points.

    2022JOURNAL OF APPLIED BEHAVIORAL SCIENCE(2022)引用:8
    引用
    AI阅读
    加入学术空间
    立即登录,查看全部 17 篇论文

    合作机构(13)

    Delaware Department of Education合作论文 4
    Southwestern Bell合作论文 4
    National Association of School Nurses合作论文 3
    南密西西比大学合作论文 2
    华盛顿大学合作论文 2
    美国农业部合作论文 1
    哈佛大学合作论文 1
    密歇根州立大学合作论文 1
    Seattle Public Schools合作论文 1
    Colorado Department of Education合作论文 1

    机构统计